Reversible nondeterministic finite automata

DOI10.1007/978-3-319-59936-6_3zbMath1487.68147OpenAlexW2619298142MaRDI QIDQ1705574

Markus Holzer, Martin Kutrib

Publication date: 16 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-59936-6_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other nonclassical models of computation (68Q09)

Related Items (11)

Quotients and atoms of reversible languages ⋮ From reversible programming languages to reversible metalanguages ⋮ Controlled reversibility in communicating reaction systems ⋮ Reversible computing from a programming language perspective ⋮ Simulating reversible computation with reaction systems ⋮ Finite automata with undirected state graphs ⋮ Unnamed Item ⋮ Reversible parallel communicating finite automata systems ⋮ An instruction set for reversible Turing machines ⋮ Transition graphs of reversible reaction systems ⋮ Descriptional complexity of regular languages

This page was built for publication: Reversible nondeterministic finite automata