Minimization and Characterizations for Biautomata

DOI10.3233/FI-2015-1146zbMath1335.68123OpenAlexW1656510936MaRDI QIDQ2805401

Markus Holzer, Sebastian Jakobi

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1146

zbMATH Keywords

minimizationstructural propertiescommutative languagescyclic languagesnondeterministic biautomata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ On linear languages recognized by deterministic biautomata ⋮ Characterization and complexity results on jumping finite automata

This page was built for publication: Minimization and Characterizations for Biautomata