On Stateless Deterministic Restarting Automata
From MaRDI portal
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 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
(11)- On special forms of restarting automata
- On the expressive power of stateless ordered restart-delete automata
- Globally deterministic CD-systems of stateless R-automata with window size 1
- On stateless two-pushdown automata and restarting automata
- A characterization of the context-free languages by stateless ordered restart-delete automata
- On CD-systems of stateless deterministic R-automata with window size one
- scientific article; zbMATH DE number 7444013 (Why is no real title available?)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*
- New results on vector and homing vector automata
- On some decision problems for stateless deterministic ordered restarting automata
- On stateless deterministic 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 Q3599085)