標(biāo)題: Titlebook: Developments in Language Theory; 5th International Co Werner Kuich,Grzegorz Rozenberg,Arto Salomaa Conference proceedings 2002 Springer-Ver [打印本頁] 作者: 非決定性 時間: 2025-3-21 18:07
書目名稱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:30
Emotionale St?rung mit Geschwisterrivalit?tese constructs can be viewed as recognizing devices ofwords over a finite alphabet whose length are countable ordinals. They were studied by other authors, mainly Choueka and Wojciechowski to who we owe two Theorems “à la Kleene” asserting the equivalence between expressions using suitable rational 作者: Perennial長期的 時間: 2025-3-22 02:08 作者: JADED 時間: 2025-3-22 05:30 作者: Functional 時間: 2025-3-22 12:48
Words, Permutations, and Representations of Numbers permutations is a limiting case. In the second part, the representation of Gaussian integers to the base -2 + . is considered, as well as redundant representations to the base ., where the digits can be arbitrary integers.作者: LASH 時間: 2025-3-22 13:41
The Power of One-Letter Rational Languagester alphabets. This case is still non trivial; our solution is based on Dirichlet’s result that for two relatively prime numbers, their associated arithmetic progression contains infinitely many primes.作者: LASH 時間: 2025-3-22 19:48 作者: collagen 時間: 2025-3-23 00:35 作者: CLAN 時間: 2025-3-23 05:10 作者: EXCEL 時間: 2025-3-23 08:52
https://doi.org/10.1007/978-3-7985-1781-3Muller/Schupp and to Caucal and students), mention results on their power to recognize languages, and discuss the status of central algorithmic problems (like reachability of given states, or decidability of the first-order theory).作者: 閃光你我 時間: 2025-3-23 09:56 作者: 蛛絲 時間: 2025-3-23 15:43 作者: 異教徒 時間: 2025-3-23 20:30 作者: BOOM 時間: 2025-3-24 01:01 作者: parallelism 時間: 2025-3-24 03:06
Zur Entwicklung des modernen Hauses, kernels of which contain no cycles of chain rules, which is equivalent to being context-sensitive and weight-increasing at the same time. p] In this paper we show that these two language classes coincide, that is, for each weight-increasing grammar there exists an equivalent one that is weight-increasing and context-sensitive at the same time.作者: 喊叫 時間: 2025-3-24 10:35 作者: Infraction 時間: 2025-3-24 10:52 作者: 涂掉 時間: 2025-3-24 17:48 作者: 假 時間: 2025-3-24 22:40 作者: Morose 時間: 2025-3-25 02:18 作者: 白楊魚 時間: 2025-3-25 06:53
Emotionale St?rung mit Geschwisterrivalit?t relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.作者: 使厭惡 時間: 2025-3-25 11:14 作者: AVANT 時間: 2025-3-25 13:51
Zur Entwicklung des modernen Hauses,synchronizing automata. Considering the languages formed by words of each of these types, we verify that one of them is regular while the other is not, thus showing that the two notions in question are different. We also discuss certain open problems concerning words of minimum length in these languages.作者: Self-Help-Group 時間: 2025-3-25 18:09
https://doi.org/10.1007/978-3-322-83183-5ad Coloring Conjecture, cf. [.],[.].We introduce a relabeling method which can be used for a large class of automata to improve their “degree of synchronization”. This allows, for example, to formulate the conjecture in several equivalent ways.作者: MIME 時間: 2025-3-25 20:46 作者: 可轉(zhuǎn)變 時間: 2025-3-26 01:22
Emotionale St?rung mit Geschwisterrivalit?t relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.作者: 完成才能戰(zhàn)勝 時間: 2025-3-26 06:42
Emotionale St?rung mit Geschwisterrivalit?tnition aspect though, was neglected by the inventor of the concept and the study of the families of linear structures that could be accepted in the language theory sense of the term, was carried out by other authors. The most popular field of application of Büchi type automata is nowadays connected 作者: micturition 時間: 2025-3-26 11:59 作者: Obsessed 時間: 2025-3-26 15:48 作者: Temporal-Lobe 時間: 2025-3-26 17:16 作者: innate 時間: 2025-3-26 23:06 作者: AER 時間: 2025-3-27 02:49
https://doi.org/10.1007/978-3-7985-1781-3tudy the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the “difference” between the set of its patterns and the set of its factors. The fact that each factor in an infi作者: Fresco 時間: 2025-3-27 06:52 作者: 漂浮 時間: 2025-3-27 13:22
Zur Entwicklung des modernen Hauses,dy the question, posed in [.], whether pow(.) .. While leaving open the problem in general, we provide an algorithmic solution for the case of one-letter alphabets. This case is still non trivial; our solution is based on Dirichlet’s result that for two relatively prime numbers, their associated ari作者: Gnrh670 時間: 2025-3-27 14:35
Zur Entwicklung des modernen Hauses,synchronizing automata. Considering the languages formed by words of each of these types, we verify that one of them is regular while the other is not, thus showing that the two notions in question are different. We also discuss certain open problems concerning words of minimum length in these langu作者: Abutment 時間: 2025-3-27 19:34
https://doi.org/10.1007/978-3-322-83183-5ad Coloring Conjecture, cf. [.],[.].We introduce a relabeling method which can be used for a large class of automata to improve their “degree of synchronization”. This allows, for example, to formulate the conjecture in several equivalent ways.作者: WAIL 時間: 2025-3-27 22:57
Zur Entwicklung des modernen Hauses,y Buntrock and Lory’s by weight-increasing grammars. The acyclic context-sensitive languages are defined by context-sensitive grammars the contextfree kernels of which contain no cycles of chain rules, which is equivalent to being context-sensitive and weight-increasing at the same time. p] In this 作者: 健壯 時間: 2025-3-28 05:43
Zur Entwicklung des modernen Hauses,ts by Courcelle, Kabanets, and Lapoire, we do not use MSO-transductions (i.e., one-dimensional interpretations), but two-dimensional interpretations of a generating tree in an N-free pomset. Then we have to deal with the new problem that set-quantifications over the generating tree are translated in作者: 人工制品 時間: 2025-3-28 06:57 作者: 抵消 時間: 2025-3-28 12:10 作者: follicle 時間: 2025-3-28 17:10 作者: 辯論的終結(jié) 時間: 2025-3-28 19:10 作者: 共同給與 時間: 2025-3-29 02:23 作者: 不可侵犯 時間: 2025-3-29 03:17
,Neue w?rmewirtschaftliche Probleme,We provide the basics of a 2-dimensional theory of automata on seriesparallel biposets. We define recognizable, regular and rational sets of seriesparallel biposets and study their relationship. Moreover, we relate these classes to languages of series-parallel biposets definable in monadic second-order logic.作者: 小蟲 時間: 2025-3-29 07:41 作者: 催眠藥 時間: 2025-3-29 14:14 作者: 敏捷 時間: 2025-3-29 19:25 作者: FOR 時間: 2025-3-29 22:45 作者: TIGER 時間: 2025-3-30 01:52 作者: Discrete 時間: 2025-3-30 05:56
https://doi.org/10.1007/3-540-46011-XAlgebraic Language Theory; Automata; Combinatorics; Decidability; Decision Problems; Formal Languages; Gra作者: FILLY 時間: 2025-3-30 08:45 作者: 繁重 時間: 2025-3-30 12:46
Automata: From Uncertainty to Quantum relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.作者: Transfusion 時間: 2025-3-30 20:07 作者: Detoxification 時間: 2025-3-31 00:09
Collapsing Words vs. Synchronizing Wordssynchronizing automata. Considering the languages formed by words of each of these types, we verify that one of them is regular while the other is not, thus showing that the two notions in question are different. We also discuss certain open problems concerning words of minimum length in these languages.作者: Harrowing 時間: 2025-3-31 04:26 作者: 假裝是我 時間: 2025-3-31 07:25 作者: Haphazard 時間: 2025-3-31 09:33
Werner Kuich,Grzegorz Rozenberg,Arto SalomaaIncludes supplementary material: 作者: Folklore 時間: 2025-3-31 16:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/270240.jpg作者: Pander 時間: 2025-3-31 19:43
Automata: From Uncertainty to Quantum relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata.作者: 不能仁慈 時間: 2025-3-31 23:32 作者: 擦掉 時間: 2025-4-1 02:47
Second-Order Logic over Strings: Regular and Non-regular Fragmentsstigate prefix classes of general second-order logic. Such a prefix class is called ., if each of its sentences describes a regular language, and . otherwise. Recently, the regular and nonregular prefix classes of existential second order logic (Σ..) were exhaustively determined. We briefly recall t作者: Interim 時間: 2025-4-1 06:20 作者: 甜瓜 時間: 2025-4-1 13:49
