scientific article; zbMATH DE number 5309908

DOI10.25596/JALC-2007-069MaRDI QIDQ3517095zbMATH OpenFDO

Authors C. Câmpeanu, N. Sântean, Sheng Yu

Publication date 12 August 2008

Full work available at URL https://doi.org/10.25596/JALC-2007-069

zbMATH Keywords

nondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
• scientific article; zbMATH DE number 1759430
• Reducing NFAs by invariant equivalences.
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• Automata, Languages and Programming
• Implementation and Application of Automata
• Theory Is Forever
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 1502106
• Nondeterministic state complexity for suffix-free regular languages

Cited in

(1)

• Mergible states in large NFA

This page was built for publication:

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