On the closure properties of linear conjunctive languages

[1]  Lucian Ilie,et al.  On strongly context-free languages , 2000, Discret. Appl. Math..

[2]  Ivan Hal Sudborough,et al.  A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[3]  Markus Holzer,et al.  On the Complexities of Linear LL(1) and LR(1) Grammars , 1993, FCT.

[4]  Detlef Wotschke,et al.  The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages , 1973, GI Jahrestagung.

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

[6]  Arnold L. Rosenberg,et al.  A Machine Realization of the Linear Context-Free Languages , 1967, Inf. Control..

[7]  Tao Jiang,et al.  Some Subclasses of Context-Free Languages In NC1 , 1988, Inf. Process. Lett..

[8]  Sheila A. Greibach,et al.  The Unsolvability of the Recognition of Linear Context-Free Languages , 1966, JACM.

[9]  G. R. Putzolu,et al.  On a Family of Linear Grammars , 1964, Inf. Control..

[10]  Sheila A. Greibach,et al.  The Undecidability of the Ambiguity Problem for Minimal Linear Grammars , 1963, Inf. Control..

[11]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[12]  Alexander Okhotin.  A recognition and parsing algorithm for arbitrary conjunctive grammars , 2003, Theor. Comput. Sci..

[13]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

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

[15]  Alexander Okhotin.  Conjunctive Grammars and Systems of Language Equations , 2004, Programming and Computer Software.