標(biāo)題: Titlebook: Language and Automata Theory and Applications; Second International Carlos Martín-Vide,Friedrich Otto,Henning Fernau Conference proceedings [打印本頁(yè)] 作者: Hazardous 時(shí)間: 2025-3-21 16:26
書目名稱Language and Automata Theory and Applications影響因子(影響力)
書目名稱Language and Automata Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Language and Automata Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Language and Automata Theory and Applications被引頻次
書目名稱Language and Automata Theory and Applications被引頻次學(xué)科排名
書目名稱Language and Automata Theory and Applications年度引用
書目名稱Language and Automata Theory and Applications年度引用學(xué)科排名
書目名稱Language and Automata Theory and Applications讀者反饋
書目名稱Language and Automata Theory and Applications讀者反饋學(xué)科排名
作者: 積極詞匯 時(shí)間: 2025-3-21 20:43
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg] concerning marked products with counter. Eilenberg’s theorem characterizing languages recognized by .-groups [2] is a special case of these results. In these proceedings I will give a simple proof of Eilenberg’s Theorem based on representation theory that I came up with for a graduate course. The 作者: 露天歷史劇 時(shí)間: 2025-3-22 03:02
About Universal Hybrid Networks of Evolutionary Processors of Small Sizege processor performs one type of point mutations (insertion, deletion or substitution) on the words in that node. The filters are defined by certain variants of random-context conditions. In this paper, we present a universal complete HNEP with 10 nodes simulating circular Post machines and show th作者: 感情脆弱 時(shí)間: 2025-3-22 07:01
On Bifix Systems and Generalizationsg). We introduce several types of infix rewriting where infix replacements are subject to the condition that they have to occur next to tag symbols within a given word. Bifix rewriting is covered by the case where tags occur only as end markers. We show results on the reachability relation (or: deri作者: Default 時(shí)間: 2025-3-22 09:32
Finite Automata, Palindromes, Powers, and Patternst one word in ., or infinitely many words. Given that . accepts at least one word in ., we consider how long the shortest word can be. The languages . that we examine include the palindromes, the non-palindromes, the .-powers, the non-.-powers, the powers, the non-powers (also called primitive words作者: PLAYS 時(shí)間: 2025-3-22 15:45
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurationss according to a causal, shift-invariant unitary evolution. By causal we mean that no instantaneous long-range communication can occur. In order to define these over a Hilbert space we must restrict to a base of finite, yet unbounded configurations. We show that QCA always admit a two-layered block 作者: Nibble 時(shí)間: 2025-3-22 17:55
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Rehis problem is undecidable. In this paper, we study the three-color and two-color Tantrix. rotation puzzle problems (3-TRP and 2-TRP) and their variants. Restricting the number of allowed colors to three (respectively, to two) reduces the set of available Tantrix. tiles from 56 to 14 (respectively, 作者: 拋媚眼 時(shí)間: 2025-3-22 22:14
Optional and Iterated Types for Pregroup Grammarsble to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs’ adverbial modifiers. This paper introduces two constructions that make up for this deficiency.作者: EXCEL 時(shí)間: 2025-3-23 03:40 作者: needle 時(shí)間: 2025-3-23 07:06 作者: 檢查 時(shí)間: 2025-3-23 10:08
Random Context in Regulated Rewriting , Cooperating Distributed Grammar Systemse random context grammars. In particular, the language families generated by CD grammar systems working in the .- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently by context-free disjoint forbidding random context grammars, and of context-free random context作者: Interim 時(shí)間: 2025-3-23 15:07 作者: Bombast 時(shí)間: 2025-3-23 19:55
Induced Subshifts and Cellular Automatamata and, while observing that the new automaton can model a different abstract dynamics, we remark several properties that are shared with the old one. After that, we simulate the old automaton inside the new one, and discuss some consequences and restrictions.作者: lavish 時(shí)間: 2025-3-24 00:44 作者: 推崇 時(shí)間: 2025-3-24 02:55
Consensual Definition of Languages by Regular Setsstrings over a bipartite alphabet made by pairs of unmarked/marked symbols, a match relation is introduced, in order to specify when such strings agree. Then a regular set over the bipartite alphabet can be interpreted as defining another language over the unmarked alphabet, called the consensual la作者: glucagon 時(shí)間: 2025-3-24 09:36 作者: 粘土 時(shí)間: 2025-3-24 11:35
On Bifix Systems and Generalizationsrelation to the condition that regularity of sets is preserved, resp. that the derivation relation is even rational. Finally, we compare our model to ground tree rewriting systems and exhibit some differences.作者: locus-ceruleus 時(shí)間: 2025-3-24 18:39
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Res are parsimonious, it follows that the problems Unique-3-TRP and Unique-2-TRP are DP-complete under randomized reductions. Finally, we prove that the infinite variants of 3-TRP and 2-TRP are undecidable.作者: cancer 時(shí)間: 2025-3-24 19:13
Deterministic Input-Reversal and Input-Revolving Finite Automataudied are not closed under standard operations. In particular, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection.作者: incite 時(shí)間: 2025-3-24 23:39
Extending the Overlap Graph for Gene Assembly in Ciliatesing system. Finally, we give characterizations of the ‘power’ of both types of graph rewriting rules. Because of the equivalence of these string and graph rewriting systems, the given characterizations can be carried over to the string rewriting system.作者: 火花 時(shí)間: 2025-3-25 05:18 作者: 相容 時(shí)間: 2025-3-25 09:33
About Universal Hybrid Networks of Evolutionary Processors of Small Sizeat every recursively enumerable language can be generated by a complete HNEP with 10 nodes. Thus, we positively answer the question posed in [5] about the possibility to generate an arbitrary recursively enumerable language over an alphabet . with a complete HNEP of a size smaller than 27?+?3·.(.).作者: 腫塊 時(shí)間: 2025-3-25 13:36 作者: 不成比例 時(shí)間: 2025-3-25 18:01 作者: Overstate 時(shí)間: 2025-3-25 20:03
0302-9743 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages978-3-540-88281-7978-3-540-88282-4Series ISSN 0302-9743 Series E-ISSN作者: Debate 時(shí)間: 2025-3-26 04:06 作者: Endoscope 時(shí)間: 2025-3-26 07:07 作者: Blanch 時(shí)間: 2025-3-26 08:33 作者: BRUNT 時(shí)間: 2025-3-26 14:25
Suna Bensch,Henning Bordihn,Markus Holzer,Martin Kutrib作者: defuse 時(shí)間: 2025-3-26 17:10 作者: 不愿 時(shí)間: 2025-3-27 01:02 作者: perjury 時(shí)間: 2025-3-27 02:30
Jér?me Champavère,Rémi Gilleron,Aurélien Lemay,Joachim Niehren作者: Congestion 時(shí)間: 2025-3-27 06:26
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurationsa should no longer be considered to be reversible in a physical sense. Note that the same two-layered block representation result applies also over infinite configurations, as was previously shown for one-dimensional systems in the more elaborate formalism of operators algebras [13]. Here the proof 作者: 思鄉(xiāng)病 時(shí)間: 2025-3-27 11:21
Random Context in Regulated Rewriting , Cooperating Distributed Grammar Systemsat of languages generated by context-free random context grammars without appearance checking. In passing we show that every language generated by a context-free random context grammar without appearance checking can also be generated by a context-free recurrent programmed grammar without appearance作者: 投射 時(shí)間: 2025-3-27 15:09
Hopcroft’s Algorithm and Cyclic Automataords taken into account are the de Bruijn words, and, by using the associated automata, it is shown that the complexity of the algorithm is tight. More precisely, the Hopcroft’s algorithm has some degrees of freedom (see Section 3) in the sense that there can be several executions of the algorithm o作者: Radiation 時(shí)間: 2025-3-27 21:29
978-3-540-88281-7Springer-Verlag Berlin Heidelberg 2008作者: tolerance 時(shí)間: 2025-3-28 00:14 作者: sultry 時(shí)間: 2025-3-28 04:53
https://doi.org/10.1007/978-3-540-88282-4Chomsky hierarchy; LA; Turing; algebraic language theory; algorithms; automata theory; calculus; combinator作者: 懦夫 時(shí)間: 2025-3-28 07:12 作者: arthroscopy 時(shí)間: 2025-3-28 12:00 作者: 諂媚于人 時(shí)間: 2025-3-28 16:15 作者: Asparagus 時(shí)間: 2025-3-28 20:41 作者: guardianship 時(shí)間: 2025-3-29 02:30 作者: cancer 時(shí)間: 2025-3-29 03:35 作者: Admire 時(shí)間: 2025-3-29 08:39
Optional and Iterated Types for Pregroup Grammarsble to naturally define types corresponding to optional and iterated arguments such as optional complements of verbs or verbs’ adverbial modifiers. This paper introduces two constructions that make up for this deficiency.作者: 凹室 時(shí)間: 2025-3-29 13:10 作者: 繞著哥哥問 時(shí)間: 2025-3-29 17:01 作者: 整潔漂亮 時(shí)間: 2025-3-29 21:20
Conference proceedings 2008d in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages作者: 一起 時(shí)間: 2025-3-30 00:08
0302-9743 2008, held in Tarragona, Spain, in March 2008. The 40 revised full papers presented were carefully reviewed and selected from 134 submissions. The papers deal with the various issues related to automata theory and formal languages978-3-540-88281-7978-3-540-88282-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 縱欲 時(shí)間: 2025-3-30 07:14
7樓作者: Cantankerous 時(shí)間: 2025-3-30 12:00
7樓作者: abnegate 時(shí)間: 2025-3-30 15:39
7樓作者: CARK 時(shí)間: 2025-3-30 19:20
8樓作者: cloture 時(shí)間: 2025-3-30 21:00
8樓作者: HUSH 時(shí)間: 2025-3-31 01:46
8樓作者: 粗糙 時(shí)間: 2025-3-31 07:39
8樓作者: Anhydrous 時(shí)間: 2025-3-31 10:10
9樓作者: Vsd168 時(shí)間: 2025-3-31 15:41
9樓作者: NATTY 時(shí)間: 2025-3-31 20:09
9樓作者: 喊叫 時(shí)間: 2025-4-1 00:57
9樓作者: LATHE 時(shí)間: 2025-4-1 01:51
10樓作者: 微枝末節(jié) 時(shí)間: 2025-4-1 07:12
10樓作者: AROMA 時(shí)間: 2025-4-1 10:39
10樓作者: 推崇 時(shí)間: 2025-4-1 14:55
10樓
