Finite turns and the regular closure of linear context-free languages

Turn bounded pushdown automata with different conditions for beginning a new turn are investigated. Their relationships with closures of the linear context-free languages under regular operations are studied. For example, automata with an unbounded number of turns that have to empty their pushdown store up to the initial symbol in order to start a new turn are characterized by the regular closure of the linear languages. Automata that additionally have to re-enter the initial state are (almost) characterized by the Kleene star closure of the linear languages. For both a bounded and an unbounded number of turns, requiring to empty the pushdown store is a strictly stronger condition than requiring to re-enter the initial state. Several new language families are obtained which form a double-stranded hierarchy. Closure properties of these families under AFL operations are derived. The regular closure of the linear languages share the strong closure properties of the context-free languages, i.e., the family is a full AFL. Interestingly, three natural new language families are not closed under intersection with regular languages and inverse homomorphism. Finally, an algorithm is presented parsing languages from the new families in quadratic time.

[1]  Etsuro Moriya,et al.  On The Space Complexity Of Turn Bounded Pushdown Automata , 2003, Int. J. Comput. Math..

[2]  Oscar H. Ibarra,et al.  Parallel Parsing on a One-Way Linear Array of Finite-State Machines , 1991, Theor. Comput. Sci..

[3]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

[4]  Ludwig Balke,et al.  Einführung in die Automatentheorie und Theorie formaler Sprachen , 1993 .

[5]  Alvy Ray Smith,et al.  Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

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

[7]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[8]  Andreas Malcher.  On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata , 2005, DCFS.

[9]  Mark-Jan Nederhof,et al.  Regular Closure of Deterministic Languages , 1999, SIAM J. Comput..

[10]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

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

[12]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[13]  Martin Kutrib.  Automata arrays and context-free languages , 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  J. Shepherdson,et al.  Computer programming and formal systems , 1965 .

[16]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[17]  David A. Workman.  Turn-Bounded Grammars and Their Relation to Ultralinear Languages , 1976, Inf. Control..

[18]  Pavel Strnad.  Turing Machine Recognition , 1973, MFCS.