A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*

DOI10.3233/FI-2021-2035MaRDI QIDQ5164869zbMATH OpenOpenAlexFDO

Authors Friedrich Otto

Publication date 15 November 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2021-2035

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Restarting automata with restricted utilization of auxiliary symbols
• Restarting automata with auxiliary symbols restricted by lookahead size
• Implementation and Application of Automata
• On stateless deterministic restarting automata
• On Stateless Deterministic Restarting Automata
• Restarting Automata with Auxiliary Symbols and Small Lookahead
• scientific article; zbMATH DE number 2040896
• On restarting automata with auxiliary symbols and small window size
• Non-recursive trade-offs for deterministic restarting automata
• scientific article; zbMATH DE number 1836418

Cites work

• scientific article; zbMATH DE number 2040896 (Why is no real title available?)
• scientific article; zbMATH DE number 2080930 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 1394484 (Why is no real title available?)
• scientific article; zbMATH DE number 2245557 (Why is no real title available?)
• Church-Rosser Thue systems and formal languages
• Degrees of non-monotonicity for restarting automata
• Developments in Language Theory
• Growing context-sensitive languages and Church-Rosser languages
• Hierarchies of weakly monotone restarting automata
• LR-regular grammars - an extension of LR(k) grammars
• Left-to-right regular languages and two-way restarting automata
• Lower bound technique for length-reducing automata
• Membership for growing context-sensitive grammars is polynomial
• On growing context-sensitive languages
• On the complexity of 2-monotone restarting automata
• Recent advances in formal languages and applications.
• Restarting automata
• Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
• SHRINKING RESTARTING AUTOMATA
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Cited in

(1)

• Restarting Automata with Auxiliary Symbols and Small Lookahead

This page was built for publication: A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164869)