A1 Refereed original research article in a scientific journal
BOOLEAN GRAMMARS AND GSM MAPPINGS
Authors: Lehtinen Tommi, Okhotin Alexander
Publisher: WORLD SCIENTIFIC PUBL CO PTE LTD
Publication year: 2010
Journal:International Journal of Foundations of Computer Science
Journal name in sourceINTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Journal acronym: INT J FOUND COMPUT S
Number in series: 5
Volume: 21
Issue: 5
First page : 799
Last page: 815
Number of pages: 17
ISSN: 0129-0541
DOI: https://doi.org/10.1142/S0129054110007568
Abstract
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
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
UTU Research Portal