Minimal and Hyper-Minimal Biautomata

DOI10.1007/978-3-319-09698-8_26zbMath1425.68207OpenAlexW2183328018MaRDI QIDQ5891816

Sebastian Jakobi, Markus Holzer

Publication date: 14 October 2014

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09698-8_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Minimal Reversible Deterministic Finite Automata

This page was built for publication: Minimal and Hyper-Minimal Biautomata