Restarting automata with restricted utilization of auxiliary symbols

DOI10.1016/j.tcs.2006.07.023zbMath1153.68031OpenAlexW2018689171MaRDI QIDQ860860

Tomasz Jurdziński, Friedrich Otto

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.023

zbMATH Keywords

restarting automaton\(k\)-linear languageauxiliary symbol

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Membership for growing context-sensitive grammars is polynomial
• Degrees of non-monotonicity for restarting automata
• Recent advances in formal languages and applications.
• Context-free languages can be accepted with absolutely no space overhead
• Church-Rosser Thue systems and formal languages
• Restarting automata
• Developments in Language Theory
• Developments in Language Theory
• Developments in Language Theory