Restarting automata with auxiliary symbols restricted by lookahead size

DOI10.1080/00207160.2014.926005zbMath1328.68119arXiv1101.1640OpenAlexW2039054049WikidataQ59783891 ScholiaQ59783891MaRDI QIDQ5248075

Natalie Schluter

Publication date: 27 April 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.1640

zbMATH Keywords

context-free languagesrestarting automatalinear languagesChurch-Rosserauxiliary symbolslookahead hierarchylookahead size

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (5)

Weighted restarting automata and pushdown relations ⋮ One-Way Restarting Automata and Their Sensitivitys ⋮ Unnamed Item ⋮ Algebraic state space approach to model and control combined automata ⋮ On restarting automata with auxiliary symbols and small window size

Cites Work

• Unnamed Item
• Degrees of non-monotonicity for restarting automata
• LR-regular grammars - an extension of LR(k) grammars
• Hierarchies of weakly monotone restarting automata
• On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract)
• Left-to-right regular languages and two-way restarting automata

This page was built for publication: Restarting automata with auxiliary symbols restricted by lookahead size