Controlled pushdown automata

Abstract A device called controlled pushdown automaton (CPA) is introduced and special classes of it are shown to characterize the families of simple matrix languages (SML's) and right-linear simple matrix languages (RLSML's). Other special classes are shown to define, respectively, the smallest full AFL containing the SML's and the smallest full AFL containing the RLSML's. Hierarchy theorems and other related results are also obtained. In particular, it is shown that the smallest full AFL containing the homomorphic replications of the context-free languages is not principal.

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

[2]  Oscar H. Ibarra,et al.  Simple Matrix Languages , 1970, Inf. Control..

[3]  Rani Siromoney.  Finite-Turn Checking Automata , 1971, J. Comput. Syst. Sci..

[4]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[5]  Rani Siromoney,et al.  On Equal Matrix Languages , 1969, Inf. Control..

[6]  Seymour Ginsburg,et al.  Abstract Families of Languages , 1967, SWAT.

[7]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[8]  Oscar H. Ibarra,et al.  Multi-Tape and Multi-Head Pushdown Automata , 1968, Inf. Control..

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

[10]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.