This article is cited in 14 papers

MATHEMATICS

Algorithmic unsolvability of the problem of completeness recognition for finite automata

M. I. Kratko

Institute of Mathematics with Computing Center, Siberian Branch of USSR Academy of Sciences, Novosibirsk

Presented: A. I. Mal'tsev
Received: 19.10.1963

Bibliographic databases:

• 
•