Solvability of the problem of completeness of automaton basis depending on its Boolean part

DOI10.3103/S0027132219010066zbMath1416.68117OpenAlexW2941581753MaRDI QIDQ2319977

Dmitriĭ Nikolaevich Babin

Publication date: 21 August 2019

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132219010066

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Boolean functions (06E30)

Cites Work

• On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
• On the classification of bases in \(P_k\) according to the decidability of the completeness problem for automata
• Completeness conditions for finite automata
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Unnamed Item
• Unnamed Item

This page was built for publication: Solvability of the problem of completeness of automaton basis depending on its Boolean part