State hierarchy for one-way finite automata

DOI10.25596/JALC-2007-139zbMATH Open1149.68049MaRDI QIDQ3517099FDOQ3517099

Authors Viliam Geffert 

Publication date 12 August 2008

zbMATH Keywords

descriptional complexityregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Magic Numbers in the State Hierarchy of Finite Automata
• A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
• scientific article; zbMATH DE number 1759430
• Magic numbers in the state hierarchy of finite automata
• scientific article; zbMATH DE number 1156489

Cited in

(2)

• Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols
• scientific article; zbMATH DE number 1949664 (Why is no real title available?)

This page was built for publication: State hierarchy for one-way finite automata

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