Dmitry N. Babin

Finiteness of the set of automaton Post bases with solvable completeness problem

The bases under consideration are those of the form Μ = Φ U v, where Φ is a Post class and ν is a finite system of automaton functions. It is shown that the sets of Post classes Φ for which the completeness problem for Φ U v is solvable, respectively, the Λ-completeness problem for Φ U v is solvable, are finite.

An Automata Approach to Analysis and Synthesis of Audio and Video Patterns

This paper describes some problems in the field of human-computer interaction, such as recognition, compression and synthesis of information in a form customary for a human. The information is represented in computer in a digital form. According to the level of complexity it can be ranked as video information, speech, handwriting texts and printed texts.