scientific article; zbMATH DE number 1330031
From MaRDI portal
Publication:4258214
zbMath0951.68056MaRDI QIDQ4258214
Publication date: 1 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
automataformal languagescontext-free languagesregular languagespushdown transducersfinite transducersTuring transducers
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45)
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Controlled finite automata ⋮ CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages ⋮ Nonterminal complexity of one-sided random context grammars ⋮ Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete ⋮ Deep pushdown automata ⋮ Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way ⋮ Unnamed Item ⋮ Stack-like and queue-like dynamics in recurrent neural networks ⋮ Cayley Automatic Groups and Numerical Characteristics of Turing Transducers ⋮ Unnamed Item ⋮ One-sided random context grammars ⋮ On the power of deep pushdown stacks ⋮ GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA
