论文信息 - Sets Constructed by Acceptors

Sets Constructed by Acceptors

Sets of both finite and infinite sequences can be constructed by acceptors; special cases of these acceptors and the structure of the corresponding constructed sets were studied by Meznik (1972) . We give a complete characterization of sets constructed by acceptors of three special classes and a new complete characterization of regular sets.

Miroslav Novotný

[1] Ivan Mezník. G-Machines and Generable Sets , 1972, Inf. Control..

[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[3] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .