Minimization and characterizations for biautomata

DOI10.3233/FI-2015-1146MaRDI QIDQ2805401zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Descriptional complexity of biautomata
• Minimal and hyper-minimal biautomata
• On biautomata
• Minimal and hyper-minimal biautomata (extended abstract)
• Nondeterministic biautomata and their descriptional complexity

Cited in

(11)

• More structural characterizations of some subregular language families by biautomata
• Descriptional complexity of biautomata
• Minimal and hyper-minimal biautomata
• Nondeterministic biautomata and their descriptional complexity
• Nondeterministic biautomata and their descriptional complexity
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• On biautomata
• Characterization and complexity results on jumping finite automata
• On linear languages recognized by deterministic biautomata
• Minimal and hyper-minimal biautomata (extended abstract)
• On bidirectional deterministic finite automata

This page was built for publication: Minimization and characterizations for biautomata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805401)