標(biāo)題: Titlebook: Developments in Language Theory; 18th International C Arseny M. Shur,Mikhail V. Volkov Conference proceedings 2014 Springer International P [打印本頁] 作者: Glycemic-Index 時間: 2025-3-21 18:28
書目名稱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é)科排名
作者: 傾聽 時間: 2025-3-21 22:18
978-3-319-09697-1Springer International Publishing Switzerland 2014作者: 憤慨點吧 時間: 2025-3-22 01:23 作者: 柏樹 時間: 2025-3-22 07:10
Cognitive Models of Body Experiencees. We show that, as in the case of the uniform distribution, the average complexity is super-polynomial even if we consider random deterministic automata with only one final state. We therefore go beyond the previous study where the number of final states was linear in the number of states. Our res作者: medium 時間: 2025-3-22 12:35 作者: Biguanides 時間: 2025-3-22 13:14 作者: Biguanides 時間: 2025-3-22 19:31
Renato Paredes Venero,Alex Davila problem is to decide whether a given reachable partial automaton is synchronizing. The second one is, given an .-state binary complete synchronizing automaton, to compute its reset threshold within performance ratio less than . ln (.) for a specific constant .?>?0.作者: 偏離 時間: 2025-3-23 01:13 作者: 易受騙 時間: 2025-3-23 02:05
Cindy L. Bethel,Zachary Henkel,Kenna Baugustomata. Our proof uses equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result leads to the notion of rank of a regular language ., which is the minimal adjacency matrix rank of a deterministic automaton that recognises .. We then define and focus on 作者: lactic 時間: 2025-3-23 08:19
Farms, Landscapes, Food and Relationships(R. Alur, P. Madhusudan, “Adding nesting structure to words”, J.ACM 56(3), 2009). This paper considers the special case of .-path NIDPDAs, which have at most . computations on any input. It is shown that the smallest deterministic IDPDA equivalent to a .-path NIDPDA of size . is of size Θ(..). The p作者: Maximize 時間: 2025-3-23 09:58 作者: 強(qiáng)壯 時間: 2025-3-23 14:07
Jan L. M. Vaarten,Nancy De Briyne it was pushed within a bounded number of contexts of . (..). We contribute to show that scoped . are indeed a robust model of computation, by focusing on the corresponding theory of .. (.). We prove the equivalence of the deterministic and nondeterministic versions and show that scope-bounded compu作者: Rinne-Test 時間: 2025-3-23 18:24 作者: 發(fā)展 時間: 2025-3-24 02:15 作者: 顯示 時間: 2025-3-24 02:33 作者: Granular 時間: 2025-3-24 06:48
Humanbiologie für Lehramtsstudierendeed to allow reasoning on properties of the resulting sets of tilings. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected.作者: 愛了嗎 時間: 2025-3-24 12:17
Humanbiologie für Lehramtsstudierendee algorithm for identifying all occurrences of factors in a text that are .-abelian equivalent to some pattern .. Moreover, an optimal algorithm for finding the largest . for which two words are .-abelian equivalent is given. Solutions for various online versions of the .-abelian pattern matching pr作者: 馬籠頭 時間: 2025-3-24 16:58
Funktion von Blut und Immunsystem,y contain the same number of occurrences of each factor of length at most .. We say that a word is a .-. if it is .-abelian equivalent to its reversal. A question we deal with is the following: how many distinct palindromes can a word contain? It is well known that a word of length . can contain at 作者: 粉筆 時間: 2025-3-24 19:48
Wolfgang Clauss,Cornelia Clauss denotes the set of positive integers. Two finite words . and . in .. are said to be .-abelian equivalent if for all .?∈?.. of length less than or equal to ., the number of occurrences of . in . is equal to the number of occurrences of . in .. This defines a family of equivalence relations ~. on ..,作者: Ibd810 時間: 2025-3-25 00:01
,Ern?hrung, Stoffwechsel und Verdauung,quares and order-preserving squares. The word . is an Abelian (parameterized, order-preserving) square if . and . are equivalent in the Abelian (parameterized, order-preserving) sense. The maximum number of ordinary squares is known to be asymptotically linear, but the exact bound is still investiga作者: 鋼盔 時間: 2025-3-25 06:32 作者: Obligatory 時間: 2025-3-25 07:46 作者: Cumulus 時間: 2025-3-25 14:17 作者: vanquish 時間: 2025-3-25 16:18
Cognitive Models of Body Experiencees. We show that, as in the case of the uniform distribution, the average complexity is super-polynomial even if we consider random deterministic automata with only one final state. We therefore go beyond the previous study where the number of final states was linear in the number of states. Our result holds for alphabets with at least 3 letters.作者: 清真寺 時間: 2025-3-25 23:58 作者: 遭受 時間: 2025-3-26 03:10 作者: violate 時間: 2025-3-26 06:59
https://doi.org/10.1007/978-3-030-42307-0ynchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous ?erny automata is at most cubic in the number of states.作者: Arthritis 時間: 2025-3-26 12:26
https://doi.org/10.1007/978-3-030-85277-1t height for any two look-ahead states of the transducer. We present an algorithm that, for a given transducer with a known difference bound, decides whether it is equivalent to a transducer without regular look-ahead, and constructs such a transducer if the answer is positive. All transducers are total and deterministic.作者: Hyaluronic-Acid 時間: 2025-3-26 16:14
Humanbiologie für Lehramtsstudierendeed to allow reasoning on properties of the resulting sets of tilings. With the help of this construction, we prove that this tileset has positive entropy. We also explain why this result was not expected.作者: 合乎習(xí)俗 時間: 2025-3-26 20:32 作者: micturition 時間: 2025-3-26 22:29
Upper Bounds on Syntactic Complexity of Left and Two-Sided Idealsd language with . left quotients (that is, with state complexity .) is at most ..?+?.???1, and that of a two-sided ideal or a factor-closed language is at most ..?+?(.???2)2.?+?1. Since these bounds are known to be reachable, this settles the problems.作者: SEVER 時間: 2025-3-27 05:09
On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number oes. We show that, as in the case of the uniform distribution, the average complexity is super-polynomial even if we consider random deterministic automata with only one final state. We therefore go beyond the previous study where the number of final states was linear in the number of states. Our result holds for alphabets with at least 3 letters.作者: 細(xì)頸瓶 時間: 2025-3-27 06:58
State Complexity of Deletion complexity of deleting an arbitrary language from a regular language and a matching lower bound. We show that the state complexity of deletion is . ·2. (respectively, .) when using complete (respectively, incomplete) deterministic finite automata.作者: 一個攪動不安 時間: 2025-3-27 11:13
On Two Algorithmic Problems about Synchronizing Automata problem is to decide whether a given reachable partial automaton is synchronizing. The second one is, given an .-state binary complete synchronizing automaton, to compute its reset threshold within performance ratio less than . ln (.) for a specific constant .?>?0.作者: 侵略者 時間: 2025-3-27 15:51
Synchronizing Automata with Random Inputsynchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous ?erny automata is at most cubic in the number of states.作者: Gratulate 時間: 2025-3-27 20:00 作者: 盡管 時間: 2025-3-28 00:30 作者: cinder 時間: 2025-3-28 05:40
-Abelian Pattern Matchinge algorithm for identifying all occurrences of factors in a text that are .-abelian equivalent to some pattern .. Moreover, an optimal algorithm for finding the largest . for which two words are .-abelian equivalent is given. Solutions for various online versions of the .-abelian pattern matching problem are also proposed.作者: Dungeon 時間: 2025-3-28 09:24 作者: 要控制 時間: 2025-3-28 12:14
On Automatic Transitive GraphsWe study infinite automatic transitive graphs. In particular we investigate automaticity of certain Cayley graphs. We provide examples of infinite automatic transitive graphs that are not Cayley graphs. We prove that Cayley graphs of Baumslag–Solitar groups and the restricted wreath products of automatic transitive graphs with ? are automatic.作者: 壓碎 時間: 2025-3-28 18:09
0302-9743 g, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Au作者: 生命層 時間: 2025-3-28 20:25
Cindy L. Bethel,Zachary Henkel,Kenna Baugus rank of a regular language ., which is the minimal adjacency matrix rank of a deterministic automaton that recognises .. We then define and focus on rank-one languages. We also define the expanded canonical automaton of a rank-one language.作者: 樂意 時間: 2025-3-29 02:48 作者: BOOM 時間: 2025-3-29 05:29
Pasqualino Santori,Clemens Driessenformations evaluated in streaming. We prove the class of .s with well-nested outputs to be decidable in .. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable.作者: habitat 時間: 2025-3-29 08:37 作者: 詼諧 時間: 2025-3-29 12:57
https://doi.org/10.1007/978-3-662-64609-0r variant of pumping lemma and an analogue of Ogden lemma for this language family. We also use these statements to prove that some natural context-sensitive languages cannot be generated by tree-adjoining grammars.作者: 紀(jì)念 時間: 2025-3-29 18:53
Graph Spectral Properties of Deterministic Finite Automata rank of a regular language ., which is the minimal adjacency matrix rank of a deterministic automaton that recognises .. We then define and focus on rank-one languages. We also define the expanded canonical automaton of a rank-one language.作者: 有其法作用 時間: 2025-3-29 20:41
Input-Driven Pushdown Automata with Limited Nondeterminismat most . computations on any input. It is shown that the smallest deterministic IDPDA equivalent to a .-path NIDPDA of size . is of size Θ(..). The paper also gives an algorithm for deciding whether or not a given NIDPDA has the .-path property, for a given .; if . is fixed, the problem is P-complete.作者: 觀點 時間: 2025-3-30 02:01 作者: 織物 時間: 2025-3-30 04:58 作者: Pedagogy 時間: 2025-3-30 09:04
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammarsr variant of pumping lemma and an analogue of Ogden lemma for this language family. We also use these statements to prove that some natural context-sensitive languages cannot be generated by tree-adjoining grammars.作者: 停止償付 時間: 2025-3-30 13:54 作者: tolerance 時間: 2025-3-30 19:53
0302-9743 minoes and Multidimensional Patterns, Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic, Bio-Inspired Computing and Quantum Computing.978-3-319-09697-1978-3-319-09698-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: GLIB 時間: 2025-3-30 23:22 作者: GIDDY 時間: 2025-3-31 03:51 作者: 無禮回復(fù) 時間: 2025-3-31 06:07
Jan L. M. Vaarten,Nancy De Briynech as, the closure under complement, the decidability of universality, inclusion and equality, and a Parikh theorem. We also give a logical characterization and compare the expressiveness of the scope-bounded restriction with . classes from the literature.作者: 形容詞詞尾 時間: 2025-3-31 09:25 作者: 合同 時間: 2025-3-31 14:36
Scope-Bounded Pushdown Languagesch as, the closure under complement, the decidability of universality, inclusion and equality, and a Parikh theorem. We also give a logical characterization and compare the expressiveness of the scope-bounded restriction with . classes from the literature.作者: filicide 時間: 2025-3-31 19:02 作者: 左右連貫 時間: 2025-3-31 21:44 作者: GIBE 時間: 2025-4-1 03:14 作者: GULP 時間: 2025-4-1 06:10
Semisimple Synchronizing Automata and the Wedderburn-Artin Theoryural notion of semisimple synchronizing automata. This is a rather broad class since it contains simple synchronizing automata like those in ?erny’s series. Furthermore, semisimplicity gives the advantage of “factorizing” the problem of finding a synchronizing word into the sub-problems of finding w作者: 把手 時間: 2025-4-1 11:58
On Two Algorithmic Problems about Synchronizing Automata problem is to decide whether a given reachable partial automaton is synchronizing. The second one is, given an .-state binary complete synchronizing automaton, to compute its reset threshold within performance ratio less than . ln (.) for a specific constant .?>?0.作者: Infusion 時間: 2025-4-1 16:03
Synchronizing Automata with Random Inputsynchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous ?erny automata is at most cubic in the number of states.作者: 固定某物 時間: 2025-4-1 21:43 作者: osculate 時間: 2025-4-2 02:33 作者: 負(fù)擔(dān) 時間: 2025-4-2 03:09 作者: 評論性 時間: 2025-4-2 08:22 作者: deficiency 時間: 2025-4-2 12:16
Visibly Pushdown Transducers with Well-Nested Outputsrds, i.e. words with a call/return structure. When outputs are also structured and well nested words, .s are a natural formalism to express tree transformations evaluated in streaming. We prove the class of .s with well-nested outputs to be decidable in .. Moreover, we show that this class is closed
