On stateless deterministic restarting automata

DOI10.1007/S00236-010-0125-4MaRDI QIDQ611046zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto

Publication date 13 December 2010

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-010-0125-4

zbMATH Keywords

stateless automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Stateless Deterministic Restarting Automata
• On stateless two-pushdown automata and restarting automata
• On the descriptional complexity of stateless deterministic ordered restarting automata
• On some decision problems for stateless deterministic ordered restarting automata
• Reversible Ordered Restarting Automata

Cites work

• Catalytic P systems, semilinear sets, and vector addition systems
• Growing context-sensitive languages and Church-Rosser languages
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Non-recursive trade-offs for deterministic restarting automata
• On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
• On Stateless Multihead Finite Automata and Multihead Pushdown Automata
• On stateless two-pushdown automata and restarting automata
• Succinct description of regular languages by weak restarting automata
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages

Cited in

(16)

• On special forms of restarting automata
• On the descriptional complexity of stateless deterministic ordered restarting automata
• Reversibility for stateless ordered RRWW-automata
• On Ordered RRWW-Automata
• A note on limited pushdown alphabets in stateless deterministic pushdown automata
• On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
• On stateless two-pushdown automata and restarting automata
• On CD-systems of stateless deterministic two-phase RR(1)-automata
• A characterization of the context-free languages by stateless ordered restart-delete automata
• On Stateless Deterministic Restarting Automata
• Head and state hierarchies for unary multi-head finite automata
• scientific article; zbMATH DE number 7444013 (Why is no real title available?)
• A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*
• Stateless one-way multi-head finite automata with pebbles
• On the descriptional complexity of the window size for deleting restarting automata
• On some decision problems for stateless deterministic ordered restarting automata

This page was built for publication: On stateless deterministic restarting automata

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