On an expansion of nondeterministic finite automata

DOI10.1007/BF02832307zbMATH Open1124.68055MaRDI QIDQ2454972FDOQ2454972

Authors: Boris Melnikov 

Publication date: 22 October 2007

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

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

zbMATH Keywords

nondeterministic finite automataextended automataalgorithm of simplificationbasis automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Edge-minimization of non-deterministic finite automata
• Title not available (Why is that?)

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)