Extended nondeterministic finite automata

MaRDI QIDQ3005906zbMATH OpenFDO

Authors Boris Melnikov

Publication date 10 June 2011

Full work available at URL http://iospress.metapress.com/content/n1r0842874316217/fulltext.html

zbMATH Keywords

nondeterministic finite automataextended automataalgorithms of simplificationbasic automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On an expansion of nondeterministic finite automata
• scientific article; zbMATH DE number 1309169
• Some algorithms for equivalent transformation of nondeterministic finite automata
• Edge-minimization of non-deterministic finite automata
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY

Cited in

(4)

• Some more algorithms for Conway's universal automaton
• scientific article; zbMATH DE number 3903975 (Why is no real title available?)
• Run-Length Encoded Nondeterministic KMP and Suffix Automata
• On an expansion of nondeterministic finite automata

This page was built for publication: Extended nondeterministic finite automata

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