Boolean Grammars and GSM Mappings

It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and inverse gsm mappings (where gsm stands for a generalized sequential machine). The same results hold for conjunctive grammars, unambiguous Boolean grammars and unambiguous conjunctive grammars.

[1]  Alexander Okhotin.  Boolean grammars , 2004, Inf. Comput..

[2]  Panos Rondogiannis,et al.  Well-founded semantics for Boolean grammars , 2009, Inf. Comput..

[3]  Alexander Okhotin,et al.  Recursive descent parsing for Boolean grammars , 2007, Acta Informatica.

[4]  Alexander Okhotin.  Unambiguous Boolean grammars , 2007, Inf. Comput..

[5]  Joseph S. Ullian,et al.  Preservation of unambiguity and inherent ambiguity in context-free languages , 1966, JACM.

[6]  Oscar H. Ibarra,et al.  Characterizations and Computational Complexity of Systolic Trellis Automata , 1984, Theor. Comput. Sci..

[7]  Arto Salomaa,et al.  Systolic Trellis Automata: Stability, Decidability and Complexity , 1986, Inf. Control..

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

[9]  Alexander Okhotin,et al.  Generalized Lr Parsing Algorithm for Boolean Grammars , 2006, Int. J. Found. Comput. Sci..

[10]  Artur Jez.  Conjunctive Grammars Can Generate Non-regular Unary Languages , 2007, Developments in Language Theory.

[11]  Alexander Okhotin.  Nine Open Problems on Conjunctive and Boolean Grammars , 2007, Bull. EATCS.

[12]  Joseph S. Ullian,et al.  The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages , 1966, JACM.

[13]  Alexander Okhotin,et al.  On the equivalence of linear conjunctive grammars and trellis automata , 2004, RAIRO Theor. Informatics Appl..

[14]  Seymour Ginsburg,et al.  Operations Which Preserve Definability in Languages , 1963, JACM.

[15]  Artur Jez,et al.  Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth , 2008, Theory of Computing Systems.

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

[17]  Arto Salomaa,et al.  Systolic trellis automatat , 1984 .