The loops of the basis finite automaton and the connected questions

MaRDI QIDQ5373771zbMATH OpenFDO

Authors V. N. Dolgov, Boris Melnikov, A. A. Mel'nikova

Publication date 27 October 2017

zbMATH Keywords

algorithms for equivalent transformationbasis automatonnondeterministic finite automatapaths and cycles of a directed graphuniversal automaton

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1741789
• Some more on the basis finite automaton
• scientific article; zbMATH DE number 1382847
• Finite automata on directed graphs
• Some properties of the basis automaton

Cited in

(3)

• scientific article; zbMATH DE number 3881886 (Why is no real title available?)
• scientific article; zbMATH DE number 1941938 (Why is no real title available?)
• scientific article; zbMATH DE number 1382847 (Why is no real title available?)

This page was built for publication: The loops of the basis finite automaton and the connected questions

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