Reversible shrinking two-pushdown automata
From MaRDI portal
Publication:5867516
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- A hierarchy of fast reversible Turing machines
- Church-Rosser Thue systems and formal languages
- Growing context-sensitive languages and Church-Rosser languages
- One-way reversible multi-head finite automata
- Reversible pushdown automata
- Reversible shrinking two-pushdown automata
- Reversible space equals deterministic space
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- Two-way reversible multi-head finite automata
- Universality of a reversible two-counter machine
- What do reversible programs compute?
This page was built for publication: Reversible shrinking two-pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867516)