標題: Titlebook: Developments in Language Theory; 21st International C émilie Charlier,Julien Leroy,Michel Rigo Conference proceedings 2017 Springer Interna [打印本頁] 作者: commotion 時間: 2025-3-21 16:17
書目名稱Developments in Language Theory影響因子(影響力)
書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度
書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Developments in Language Theory被引頻次
書目名稱Developments in Language Theory被引頻次學(xué)科排名
書目名稱Developments in Language Theory年度引用
書目名稱Developments in Language Theory年度引用學(xué)科排名
書目名稱Developments in Language Theory讀者反饋
書目名稱Developments in Language Theory讀者反饋學(xué)科排名
作者: Heart-Rate 時間: 2025-3-21 21:16
Undecidability and Finite AutomataUsing a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to prove the undecidability of a related problem about .-automatic sets of rational numbers.作者: ACTIN 時間: 2025-3-22 00:53
émilie Charlier,Julien Leroy,Michel RigoIncludes supplementary material: 作者: 過分 時間: 2025-3-22 05:14 作者: 確保 時間: 2025-3-22 10:35 作者: Supplement 時間: 2025-3-22 12:53
978-3-319-62808-0Springer International Publishing AG 2017作者: Supplement 時間: 2025-3-22 20:34
Kontext und Wirkung von Suggestionene classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illu作者: ectropion 時間: 2025-3-23 00:08 作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-23 01:44
Indirekte Induktion und Kommunikationntations of integers. We discuss many results expressing the number of binomial coefficients . with a given .-adic valuation in terms of the number of occurrences of a given word in the base-. representation of ., beginning with a result of Glaisher from 1899, up through recent results by Spiegelhof作者: 縮影 時間: 2025-3-23 06:54 作者: 多余 時間: 2025-3-23 10:04
V. Jane Knox,Kit Shum,Deborah M. McLaughliner the alphabet?. with . an equivalence proof of length . can be derived within?., where?.(.) (.(.), respectively) refers to the height of?. (., respectively) and the tower function is defined as . and ., for?.. In other words . This is in sharp contrast to the fact, that regular expression equivale作者: 善辯 時間: 2025-3-23 17:55 作者: 行業(yè) 時間: 2025-3-23 21:38
V. Jane Knox,Kit Shum,Deborah M. McLaughlinterministic symbolic top-down tree transducers (.) can be reduced to that of classical .. As a consequence the equivalence of two symbolic . can be decided in ., when assuming that all operations related to the processing of data values are in .. This result can be extended to symbolic . with lookah作者: Offstage 時間: 2025-3-23 23:07 作者: 才能 時間: 2025-3-24 05:18 作者: dysphagia 時間: 2025-3-24 09:16
Die Erscheinungen der normalen Hypnose,ain result is that such alternating automata are not closed under complementation for non-unary alphabets. This improves a similar result of Kari and Moore for picture languages. We also show that these deterministic, non-deterministic and alternating automata are not closed under composition.作者: podiatrist 時間: 2025-3-24 11:36 作者: 暫時中止 時間: 2025-3-24 17:32
Rodent Models of Human Narcolepsy-cataplexyoid of transformations of the state set. For automata with . states in this class, we prove that the reset thresholds are upper-bounded by . and can attain the value .. In addition, we study diameters of the pair digraphs of permutation automata and construct .-state permutation automata with diamet作者: Myofibrils 時間: 2025-3-24 22:39
The Discovery of the Hypocretinsity classes, mainly the real time class. The main result states that given two neighborhoods . and ., if . has a limiting vertex in some direction and . have no vertex in that direction then there is a language recognizable in real time with . and not with .. One easy corollary is that real time cla作者: synovial-joint 時間: 2025-3-25 01:29 作者: Excitotoxin 時間: 2025-3-25 04:43 作者: GEN 時間: 2025-3-25 08:00
Gregory D. Judy,Bhishamjit S. Chera many models of accepting devices for which there is no difference with these problems between deterministic and nondeterministic versions, i.e., the membership problem for both versions are either decidable or undecidable, and the same holds for the emptiness problem. As far as we know, the model w作者: CONE 時間: 2025-3-25 12:35 作者: Nomadic 時間: 2025-3-25 18:41 作者: Stress 時間: 2025-3-25 21:04
On the Power of Permitting Semi-conditional Grammarsapplied to a sentential form . only if . is a subword of .. In this paper we show that the class of languages generated by permitting semi-conditional grammars with no erasing rules is strictly included in the class of context-sensitive languages.作者: 推測 時間: 2025-3-26 00:46 作者: Hla461 時間: 2025-3-26 06:54 作者: 令人悲傷 時間: 2025-3-26 08:29
Developments in Language Theory978-3-319-62809-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 補角 時間: 2025-3-26 13:25 作者: concert 時間: 2025-3-26 20:26 作者: VOK 時間: 2025-3-26 23:46
Rodent Models of Human Narcolepsy-cataplexyapplied to a sentential form . only if . is a subword of .. In this paper we show that the class of languages generated by permitting semi-conditional grammars with no erasing rules is strictly included in the class of context-sensitive languages.作者: surmount 時間: 2025-3-27 01:10 作者: 輕快帶來危險 時間: 2025-3-27 06:11 作者: Anthropoid 時間: 2025-3-27 12:24
On Regular Expression Proof Complexitynce admisses exponential proof length if . restricted to the axiom system?.. From the theoretical point of view the exponential proof length seems to be best possible, because we show that regular expression equivalence admits a polynomial bounded proof if and only if ..作者: 鍍金 時間: 2025-3-27 17:22
Operational State Complexity and Decidability of Jumping Finite Automataper bound answers an open problem from ., ., .: Operational State Complexity of Parikh Equivalence [2014]. Moreover, we correct an erroneous result on the inverse homomorphism closure. Finally, we also consider the decidability status of standard problems as regularity, disjointness, universality, inclusion, etc. for jumping finite automata.作者: 含鐵 時間: 2025-3-27 20:27
Conference proceedings 2017, arrays; algebraic theories for automata and?languages; codes; efficient text algorithms; symbolic dynamics;?decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional?patterns; cryptography; concurrency; celluar automata; bio-inspiredcomputing; quantum computing..作者: Exonerate 時間: 2025-3-28 00:57
0302-9743 ory, DLT 2017, held in Liège, Belgium, in August 2017.The 24 full papers and 6 (abstract of)? invited papers were carefully?reviewed and selected from 47 submissions. The papers cover the?following topics and areas: combinatorial and algebraic properties??of words and languages; grammars acceptors a作者: Magisterial 時間: 2025-3-28 03:00 作者: peptic-ulcer 時間: 2025-3-28 07:52 作者: 攝取 時間: 2025-3-28 12:43 作者: carbohydrate 時間: 2025-3-28 15:58
The Discovery of the Hypocretins . have no vertex in that direction then there is a language recognizable in real time with . and not with .. One easy corollary is that real time classes for two neighborhoods may be incomparable (and such neighborhoods are easy to construct).作者: Libido 時間: 2025-3-28 19:25 作者: Lipoprotein 時間: 2025-3-29 01:34
Aktuelle Perspektiven im Change Management,t now for the reverse expression. It turns out that although the conversion of regular expressions and reversal of regular expressions to finite automata seems quite similar, there are significant differences.作者: 血友病 時間: 2025-3-29 04:50
On the Mother of All Automata: The Position Automatont now for the reverse expression. It turns out that although the conversion of regular expressions and reversal of regular expressions to finite automata seems quite similar, there are significant differences.作者: liposuction 時間: 2025-3-29 07:45 作者: 贊成你 時間: 2025-3-29 14:30
Computer Aided Synthesis: A Game-Theoretic Approachto automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.作者: 蟄伏 時間: 2025-3-29 19:13
A Comprehensive Introduction to the Theory of Word-Representable Graphs alternate in . if and only if ...Word-representable graphs generalize several important classes of graphs such as circle graphs, 3-colorable graphs and comparability graphs. This paper offers a comprehensive introduction to the theory of word-represent-able graphs including the most recent developments in the area.作者: Metastasis 時間: 2025-3-29 21:18
Equivalence of Symbolic Tree Transducerscided in ., when assuming that all operations related to the processing of data values are in .. This result can be extended to symbolic . with lookahead and thus to deterministic symbolic bottom-up tree transducers.作者: harpsichord 時間: 2025-3-30 01:07 作者: defile 時間: 2025-3-30 07:29
V. Jane Knox,Kit Shum,Deborah M. McLaughlinnce admisses exponential proof length if . restricted to the axiom system?.. From the theoretical point of view the exponential proof length seems to be best possible, because we show that regular expression equivalence admits a polynomial bounded proof if and only if ..作者: 單片眼鏡 時間: 2025-3-30 11:59
V. Jane Knox,Kit Shum,Deborah M. McLaughlinper bound answers an open problem from ., ., .: Operational State Complexity of Parikh Equivalence [2014]. Moreover, we correct an erroneous result on the inverse homomorphism closure. Finally, we also consider the decidability status of standard problems as regularity, disjointness, universality, inclusion, etc. for jumping finite automata.作者: 男學(xué)院 時間: 2025-3-30 14:48
Aktuelle Perspektiven im Change Management,symbols with exponential shortest synchronizing word length, giving significantly better bounds than earlier exponential constructions. We give a transformation of this PFA to a PFA on two symbols keeping exponential shortest synchronizing word length, yielding a better bound than applying a similar known transformation.作者: GRILL 時間: 2025-3-30 18:56 作者: cancer 時間: 2025-3-30 21:24 作者: 從屬 時間: 2025-3-31 04:06 作者: 有常識 時間: 2025-3-31 07:49
Computer Aided Synthesis: A Game-Theoretic Approache classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illu作者: Scleroderma 時間: 2025-3-31 11:58
A Comprehensive Introduction to the Theory of Word-Representable Graphsr a word . (of even or odd length). A graph . is word-representable if and only if there exists a word . over the alphabet . such that letters . and . alternate in . if and only if ...Word-representable graphs generalize several important classes of graphs such as circle graphs, 3-colorable graphs a
