Degrees of non-monotonicity for restarting automata

DOI10.1016/J.TCS.2006.08.029zbMath1142.68423OpenAlexW1971514060MaRDI QIDQ861249

Tomasz Jurdziński, Friedrich Otto, Martin Plátek, František Mráz

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.08.029

zbMATH Keywords

monotonicityrestarting automatadegree of monotonicity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Restarting automata with restricted utilization of auxiliary symbols ⋮ Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata ⋮ Left-to-right regular languages and two-way restarting automata ⋮ A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ On the complexity of 2-monotone restarting automata ⋮ Unnamed Item ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ Sequential monotonicity for restarting automata ⋮ Two-dimensional hierarchies of proper languages of lexicalized FRR-automata ⋮ Restarting automata with auxiliary symbols restricted by lookahead size ⋮ On restarting automata with auxiliary symbols and small window size

Uses Software

• UCFL

Cites Work

• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Hierarchies of weakly monotone restarting automata
• Church-Rosser Thue systems and formal languages
• Restarting automata
• Developments in Language Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degrees of non-monotonicity for restarting automata