Analogies of PAL and COPY

The LIFO or pushdown principle and the FIFO or queue principle are compared in the framework of language theory. To this effect, languages which characteristically describe these principles are studied comparing the least cones or semiAFLs containing them. Although the classes of languages so obtained are different and often are incomparable, very interesting analogies are established between LIFO type languages and FIFO type languages. Thus our investigations show both, the common and the contrasting properties of LIFO and FIFO structures.

[1]  Karel Culik.  A Purely Homomorphic Characterization of Recursively Enumerable Sets , 1979, JACM.

[2]  S. Rao Kosaraju,et al.  Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version) , 1979, STOC.

[3]  Donald E. Knuth,et al.  The art of computer programming: V.1.: Fundamental algorithms , 1997 .

[4]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[5]  Seymour Ginsburg,et al.  One-way nondeterministic real-time list-storage languages , 1968, JACM.

[6]  Bernard Vauquelin,et al.  Automates a File , 1980, Theor. Comput. Sci..

[7]  Ronald V. Book,et al.  Reversal-Bounded Acceptors and Intersections of Linear Languages , 1974, SIAM J. Comput..

[8]  Seymour Ginsburg,et al.  Muhitape AFA SHEILA GREIBACH University of California at Los Angeles , Los Angeles , California * AND , 2000 .

[9]  Samuel Eilenberg,et al.  Review of "Algebraic and automata-theoretic properties of formal languages" by Seymour Ginsburg. North Holland, 1975. , 1976, SIGA.

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Sheila A. Greibach.  Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..

[12]  I. HAL SUDBOROUGH.  One-Way Multihead Writing Finite Automata , 1976, Inf. Control..

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

[14]  Franz-Josef Brandenburg,et al.  Multiple Equality Sets and Post Machines , 1980, J. Comput. Syst. Sci..

[15]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[16]  Arto Salomaa.  Equality sets for homomorphisms of free monoids , 1978, Acta Cybern..

[17]  Seymour Ginsburg,et al.  Principal AFL , 1970, J. Comput. Syst. Sci..

[18]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[19]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[20]  Luc Boasson,et al.  Two Iteration Theorems for Some Families of Languages , 1973, J. Comput. Syst. Sci..

[21]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[22]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .