Some more algorithms for Conway's universal automaton

DOI10.2478/ausi-2014-0015zbMath1372.68159OpenAlexW2085429339MaRDI QIDQ399502

Vasily Dolgov, B. F. Mel'nikov

Publication date: 19 August 2014

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

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

zbMATH Keywords

constructing algorithmsConway's universal automatonnondeterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Some more on the basis finite automaton
• On the State Minimization of Nondeterministic Finite Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some more algorithms for Conway's universal automaton