scientific article; zbMATH DE number 7584596
From MaRDI portal
Publication:5867516
Holger Bock Axelsen, Andreas Malcher, Martin Kutrib
Publication date: 14 September 2022
Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-047-077.php
Title of this publication is not available (Why is that?)
reversible computingunconventional models of computationChurch-Rosser languagesshrinking two-pushdown automata
Cites Work
- Title not available (Why is that?)
- Growing context-sensitive languages and Church-Rosser languages
- Title not available (Why is that?)
- Reversible Shrinking Two-Pushdown Automata
- A Hierarchy of Fast Reversible Turing Machines
- What Do Reversible Programs Compute?
- Church-Rosser Thue systems and formal languages
- Two-Way Reversible Multi-Head Finite Automata
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- Reversible pushdown automata
- Universality of a reversible two-counter machine
- One-way reversible multi-head finite automata
- Reversible space equals deterministic space
Cited In (1)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867516)
