標(biāo)題: Titlebook: Developments in Language Theory; 14th International C Yuan Gao,Hanlin Lu,Sheng Yu Conference proceedings 2010 Springer-Verlag Berlin Heidel [打印本頁] 作者: 搭話 時間: 2025-3-21 18:20
書目名稱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 20:35
Undecidability and Hierarchy Results for Parallel Communicating Finite Automataany type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.作者: 剝削 時間: 2025-3-22 02:57 作者: 乞討 時間: 2025-3-22 06:31
The Complexity of Regular(-Like) Expressions expressions such as, e.g., membership, inequivalence, and non-emptiness of complement, and finally on the operation problem measuring the required size for transforming expressions with additional language operations (built-in or not) into equivalent ordinary regular expressions.作者: Harpoon 時間: 2025-3-22 09:30
DNA Computing and Its Implications for Theoretical Computer Science theoretical computer science. We namely describe how properties of DNA-based information, and in particular the Watson-Crick complementarity of DNA single strands, have influenced areas of theoretical computer science such as formal language theory, coding theory, automata theory and combinatorics on words.作者: 上漲 時間: 2025-3-22 13:08
Numeration Systems: A Link between Number Theory and Formal Language Theoryets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and verification of infinite-state systems and present a list of open problems.作者: 上漲 時間: 2025-3-22 18:45
Algorithmic Properties of Millstream Systemsdules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be completed into a valid configuration of the Millstream system?作者: 檢查 時間: 2025-3-22 23:30 作者: Extricate 時間: 2025-3-23 03:30 作者: Genteel 時間: 2025-3-23 05:54
Humanistic Psychology and Metapsychology, all subclasses corresponding to different notion of unambiguity and determinism define a hierarchy inside REC. Moreover we show that some definitions of unambiguity are equivalent to corresponding notions of determinism and therefore correspond decidable classes closed under complementation and linear parsing algorithms.作者: 逗留 時間: 2025-3-23 10:04 作者: 收藏品 時間: 2025-3-23 14:17
https://doi.org/10.1007/978-1-4684-1071-6 theoretical computer science. We namely describe how properties of DNA-based information, and in particular the Watson-Crick complementarity of DNA single strands, have influenced areas of theoretical computer science such as formal language theory, coding theory, automata theory and combinatorics on words.作者: tangle 時間: 2025-3-23 20:33
https://doi.org/10.1007/978-3-86226-845-0ets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude with some applications to combinatorial game theory and verification of infinite-state systems and present a list of open problems.作者: 使成核 時間: 2025-3-23 22:58 作者: uveitis 時間: 2025-3-24 02:34
Rankers over Infinite Wordsr, the first extension of rankers admits a characterization of . while the other leads to a characterization of .. Both versions of rankers yield characterizations of the fragment Δ.?=?Σ.?∩?Π.. As a byproduct, we also obtain characterizations based on unambiguous temporal logic and unambiguous interval temporal logic.作者: persistence 時間: 2025-3-24 09:56
Two-Way Unary Automata versus Logarithmic Spacety and the state complexity of two-way unary automata: it indicates that L could be separated from?NL by proving a superpolynomial gap, in the number of states, for the conversion from unary 2NFAs to 2DFAs.作者: humectant 時間: 2025-3-24 13:27
Gian Franco Baronzio,E. Dieter Hagerfirst proof of the undecidability of the inclusion problem for NE-pattern languages that, in contrast to previous proofs, does not rely on the inclusion problem for E-pattern languages, and proves the undecidability of the inclusion problem for NE-pattern languages over binary and ternary alphabets.作者: 漂亮才會豪華 時間: 2025-3-24 16:22
Hyperthermia In Cancer Treatment: A Primere. where all its letters are made different. Experimental results suggest that the average number of states of this automaton, and of the . automaton for the unmarked regular expression, are very close to each other.作者: SEVER 時間: 2025-3-24 22:00 作者: 嬉耍 時間: 2025-3-25 00:30 作者: 大范圍流行 時間: 2025-3-25 04:46 作者: Harass 時間: 2025-3-25 07:32 作者: 撫慰 時間: 2025-3-25 11:59 作者: 魅力 時間: 2025-3-25 16:12 作者: 煩憂 時間: 2025-3-25 22:57 作者: Complement 時間: 2025-3-26 03:30
Developments in Language Theory978-3-642-14455-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 收集 時間: 2025-3-26 07:39 作者: 微塵 時間: 2025-3-26 09:50 作者: 費解 時間: 2025-3-26 12:56
https://doi.org/10.1007/978-3-319-02795-1s for synchronizing automata with . states. We refute this conjecture as well as a related conjecture by Rystsov [13] and suggest a weaker version that still suffices to achieve a quadratic upper bound.作者: 忘川河 時間: 2025-3-26 17:41 作者: 專心 時間: 2025-3-26 22:13 作者: enterprise 時間: 2025-3-27 03:33
Stephen E. Epstein,Barry J. Marons based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many outputs, the minimal transducer can be constructed in polynomial time.作者: 傳授知識 時間: 2025-3-27 09:07 作者: insightful 時間: 2025-3-27 09:43 作者: 保存 時間: 2025-3-27 15:48 作者: 橢圓 時間: 2025-3-27 19:35 作者: Accessible 時間: 2025-3-28 00:42
https://doi.org/10.1007/978-3-86226-845-0ustive but try instead to give some personal interpretations and some research directions. We discuss the notion of numeration systems, recognizable sets of integers and automatic sequences. We briefly sketch some results about transcendence related to the representation of real numbers. We conclude作者: 收集 時間: 2025-3-28 05:30
https://doi.org/10.1007/978-3-319-02795-1 different modules related by interfaces. In this paper we investigate algorithmic properties of Millstream systems having regular tree grammars as modules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be co作者: scrape 時間: 2025-3-28 09:23
https://doi.org/10.1007/978-3-319-02795-1s for synchronizing automata with . states. We refute this conjecture as well as a related conjecture by Rystsov [13] and suggest a weaker version that still suffices to achieve a quadratic upper bound.作者: 人造 時間: 2025-3-28 13:55
Textanalyse in medizinischer Lernsoftwareormal verification techniques use behavioural equivalence notions formalizing the idea of indistinguishability of system states. In this paper, we investigate the relation between two behavioural equivalences: the algebraic observational equivalence in the framework of observational algebras with ma作者: 磨碎 時間: 2025-3-28 17:18 作者: 沉默 時間: 2025-3-28 19:44
Gian Franco Baronzio,E. Dieter Hagereydenberger and Reidenbach (Information and Computation 208 (2010)) by showing that restricting the inclusion problem to significantly more restricted classes of patterns preserves undecidability, at least for comparatively large bounds. For smaller bounds, we prove the existence of classes of patte作者: 藝術(shù) 時間: 2025-3-29 01:30 作者: Protein 時間: 2025-3-29 05:20 作者: 認識 時間: 2025-3-29 08:12 作者: surrogate 時間: 2025-3-29 14:32 作者: 制造 時間: 2025-3-29 16:16
https://doi.org/10.1007/978-3-642-68282-7s of the class of Müller context-free languages including closure properties and others. We show that every Müller context-free grammar can be transformed into a normal form grammar in polynomial space without increasing the size of the grammar, and then we show that many decision problems can be so作者: bisphosphonate 時間: 2025-3-29 20:38 作者: pus840 時間: 2025-3-30 01:31
Barry J. Maron,William C. Robertsomial number of states. Moreover, if L?=?NL (the classical logarithmic space classes), then each unary 2. can be converted into an equivalent 2. (a deterministic two-way automaton), still keeping polynomial the number of states. This shows a connection between the standard logarithmic space complexi作者: Hdl348 時間: 2025-3-30 04:28 作者: Decimate 時間: 2025-3-30 10:06 作者: 使成波狀 時間: 2025-3-30 15:05
On Decision Problems for Simple and Parameterized MachinesWe introduce what we believe to be the simplest known classes of language acceptors for which we can prove that decision problems (like universe, disjointness, containment, etc.) are undecidable. We also look at classes with undecidable decision problems and show that the problems become decidable for the “parameterized” versions of the machines.作者: BLANC 時間: 2025-3-30 20:35
Computing Blocker Sets for the Regular Post Embedding ProblemBlocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these languages and related decision problems.作者: essential-fats 時間: 2025-3-31 00:20
Reaction Systems: A Model of Computation Inspired by Biochemistryture. In other words, natural computing investigates models and computational techniques inspired by nature as well as it investigates, in terms of information processing, processes taking place in nature.作者: OMIT 時間: 2025-3-31 01:45
On a Conjecture by Carpi and D’Alessandros for synchronizing automata with . states. We refute this conjecture as well as a related conjecture by Rystsov [13] and suggest a weaker version that still suffices to achieve a quadratic upper bound.作者: 畏縮 時間: 2025-3-31 08:59 作者: FLIT 時間: 2025-3-31 10:32
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Latti and for finite and infinite words. This extends classical results of Kleene and Büchi to arbitrary bounded lattices, without any distributivity assumption that is fundamental in the theory of weighted automata over semirings. In fact, we obtain these results for large classes of strong bimonoids which properly contain all bounded lattices.作者: 粘連 時間: 2025-3-31 17:07
Minimization of Deterministic Bottom-Up Tree Transducerss based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many outputs, the minimal transducer can be constructed in polynomial time.作者: fodlder 時間: 2025-3-31 18:00
https://doi.org/10.1007/978-3-642-14455-4automata theory; complexity; computability; game theory; infinite words; inite automata; logic; tar; tempora
