Theory Is Forever
From MaRDI portal
Publication:5894872
DOI10.1007/b98751zbMath1055.68071OpenAlexW2477405540MaRDI QIDQ5894872
Moore, Cristopher, Jarkko Kari
Publication date: 18 January 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98751
Related Items
Problems on finite automata and the exponential time hypothesis ⋮ Non-recursive trade-offs between two-dimensional automata and grammars ⋮ Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs ⋮ Deterministic Two-Dimensional Languages over One-Letter Alphabet ⋮ Unnamed Item ⋮ On Complexity of Two Dimensional Languages Generated by Transducers ⋮ Decision problems and projection languages for restricted variants of two-dimensional automata ⋮ Transducer generated arrays of robotic nano-arms ⋮ Deterministic and unambiguous two-dimensional languages over one-letter alphabet ⋮ A Survey on Picture-Walking Automata ⋮ Unambiguous recognizable two-dimensional languages ⋮ Undecidability of the emptiness problem for context-free picture languages
