Completeness conditions for finite automata
From MaRDI portal
Publication:5329389
DOI10.1016/0041-5553(63)90177-0zbMath0125.07803OpenAlexW2055275750MaRDI QIDQ5329389
Publication date: 1961
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(63)90177-0
Related Items (2)
The completeness problem in the function algebra of linear integer-coefficient polynomials ⋮ Solvability of the problem of completeness of automaton basis depending on its Boolean part
This page was built for publication: Completeness conditions for finite automata