To the problem of partial guessing of formal languages

The purpose of the study is to examine the infinite chains of symbols of an alphabet, generated by a marked directional graph. The findings of the research helped us to modify the notion of partial guessing. For a class of languages, we employed methods of partial guessing based on a different approach to the problems under consideration. We found a criterion and a constructive algorithm of guessing. We compared the results obtained in this study with the results obtained previously. In this research we present only basic concepts associated with graphs and automata.

References

[1] Verenikin A.G., Gasanov E.E. On the automaton determinization of sets of superworks. Discrete Mathematics and Applications, 2006, vol. 16, iss. 3, pp. 229-243.

[2] Mastikhina A.A. On the partial guessing of superwords. Intellekt. Sist. [Intelligent Systems], 2007, vol. 11, iss. 1-4, pp. 609-619 (in Russ.).

[3] Mastikhina A.A. A criterion for a partial prediction of general regular superevents. Discrete Mathematics and Applications, 2011, vol. 21, iss. 5-6, pp. 727-739.

[4] Trakhtenbrot B.A., Bardzin Ya.M. Konechnye avtomaty: povedenie i sintez [Finite automata: Behavior and synthesis]. Moscow, Nauka Publ., 1970.

[5] Mastikhina A.A. Partial Guessing Superevents Generated by the Simple LL( 1) Grammars. Intellekt. Sist. [Intelligent Systems], 2011, vol. 15, pp. 507-532 (in Russ.).