On an expansion of nondeterministic finite automata

DOI10.1007/BF02832307MaRDI QIDQ2454972zbMATH OpenFDO

Authors Boris Melnikov

Publication date 22 October 2007

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

nondeterministic finite automataextended automataalgorithm of simplificationbasis automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Extended nondeterministic finite automata
• scientific article; zbMATH DE number 1309169
• Finite nondeterministic automata: simulation and minimality
• Edge-minimization of non-deterministic finite automata
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY

Cites work

• scientific article; zbMATH DE number 1741789 (Why is no real title available?)
• scientific article; zbMATH DE number 1779719 (Why is no real title available?)
• Edge-minimization of non-deterministic finite automata

Cited in

(6)

• Extended nondeterministic finite automata
• Some algorithms for equivalent transformation of nondeterministic finite automata
• The method of forced enumeration for nondeterministic automata
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
• Tools and Algorithms for the Construction and Analysis of Systems
• Some more on the basis finite automaton

This page was built for publication: On an expansion of nondeterministic finite automata

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