Abstract:
A totality (generally incomplete) of homomorphic images of an incompletely definite deterministic automata can be described as a certain (incompletely definite) non-deterministic automaton. Each of the homomorphic images from this totality can be found using a transition diagram of such a non-deterministic automaton by a procedure without trial steps.
Fulltext:
PDF file (1471 kB)