Some algorithms for equivalent transformation of nondeterministic finite automata

DOI10.3103/S1066369X09040100MaRDI QIDQ462609zbMATH OpenFDO

Authors M. R. Saifullina, Boris Melnikov

Publication date 21 October 2014

Published in Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

nondeterministic finite automataequivalent transformationcombining statesextended automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1309169
• The minimization of a kind of non-deterministic finite automata
• scientific article; zbMATH DE number 3972192
• Once more on the edge-minimization of nondeterministic finite automata and the connected problems
• scientific article; zbMATH DE number 1472276

Cites work

• scientific article; zbMATH DE number 3767067 (Why is no real title available?)
• scientific article; zbMATH DE number 1779719 (Why is no real title available?)
• On an expansion of nondeterministic finite automata

Cited in

(9)

• scientific article; zbMATH DE number 3903975 (Why is no real title available?)
• Translating iterative algorithms into automaton ones
• The minimization of a kind of non-deterministic finite automata
• An algorithm for optimal representation of a nondeterministic finite automaton by a set-union knapsack problem
• Extended nondeterministic finite automata
• Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata
• scientific article; zbMATH DE number 3972192 (Why is no real title available?)
• Sufficient conditions of deterministic implementation of finite-state automata with retention of the numbers of their states
• scientific article; zbMATH DE number 3982526 (Why is no real title available?)

This page was built for publication: Some algorithms for equivalent transformation of nondeterministic finite automata

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