Stratified Boolean Grammars

2005 ◽  
pp. 801-812 ◽  
Author(s):  
Michał Wrona
Keyword(s):  
Boolean Grammars

BOOLEAN GRAMMARS AND GSM MAPPINGS

2010 ◽  
Vol 21 (05) ◽  
pp. 799-815 ◽  
Author(s):  
TOMMI LEHTINEN ◽  
ALEXANDER OKHOTIN
Keyword(s):  
Sequential Machine ◽  
Language Family ◽  
Conjunctive Grammars ◽  
Boolean 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.

scholarly journals Well-founded semantics for Boolean grammars

2009 ◽  
Vol 207 (9) ◽  
pp. 945-967 ◽  
Author(s):  
Vassilis Kountouriotis ◽  
Christos Nomikos ◽  
Panos Rondogiannis
Keyword(s):  
Boolean Grammars

scholarly journals Parse views with Boolean grammars

2015 ◽  
Vol 97 ◽  
pp. 59-63 ◽  
Author(s):  
Andrew Stevenson ◽  
James R. Cordy
Keyword(s):  
Boolean Grammars

scholarly journals Parsing Boolean grammars over a one-letter alphabet using online convolution

2012 ◽  
Vol 457 ◽  
pp. 149-157 ◽  
Author(s):  
Alexander Okhotin ◽  
Christian Reitwießner
Keyword(s):  
Letter Alphabet ◽  
Boolean Grammars

scholarly journals Boolean grammars

2004 ◽  
Vol 194 (1) ◽  
pp. 19-48 ◽  
Author(s):  
Alexander Okhotin
Keyword(s):  
Boolean Grammars
Sign in / Sign up

Export Citation Format

Share Document