Finite automata with undirected state graphs

DOI10.1007/s00236-021-00402-0OpenAlexW3165010732MaRDI QIDQ5918649

Christian Schneider, Martin Kutrib, Andreas Malcher

Publication date: 1 April 2022

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-021-00402-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On time-symmetry in cellular automata
• Reversible nondeterministic finite automata
• Determination of finite automata accepting subregular languages
• Time-Symmetric Machines
• Reversible and Irreversible Computations of Deterministic Finite-State Devices
• Irreversibility and Heat Generation in the Computing Process
• Minimal Reversible Deterministic Finite Automata
• Finite automata with undirected state graphs
• One-unambiguous regular languages

This page was built for publication: Finite automata with undirected state graphs