scientific article; zbMATH DE number 5181726

MaRDI QIDQ5754463zbMATH OpenFDO

Authors Chaoqun Zhang, Yongquan Zhou

Publication date 22 August 2007

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 2182418
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1156489
• Lower bound for converting an NFA with finite nondeterminism into an MDFA
• scientific article; zbMATH DE number 1848284
• Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
• On converting CNF to DNF
• Mathematical Foundations of Computer Science 2003
• Comparing the size of NFAs with and without \(\epsilon\)-transitions
• Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata

Cited in

(1)

• Testing deterministic finite automata and non-deterministic finite automata using Java program

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