BOOLEAN GRAMMARS AND GSM MAPPINGS
Tommi Lehtinen, Alexander Okhotin · International Journal of Foundations of Computer Science · 2010
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.