Some more on the basis finite automaton

DOI10.2478/ausi-2014-0012zbMath1372.68160OpenAlexW1986238652MaRDI QIDQ4981717

Aleksandra Melnikova, B. F. Mel'nikov

Publication date: 24 June 2014

Published in: Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2014-0012

zbMATH Keywords

nondeterministic finite automatabasis automatonstate-marking functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Some more algorithms for Conway's universal automaton

Cites Work

• On an expansion of nondeterministic finite automata
• On the State Minimization of Nondeterministic Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some more on the basis finite automaton