boolean grammars
Recently Published Documents

TOTAL DOCUMENTS

23
(FIVE YEARS 1)

H-INDEX

8
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Path Querying on Acyclic Graphs Using Boolean Grammars

2021 ◽  
Vol 47 (1) ◽  
pp. 88-98
Author(s):  
E. N. Shemetova ◽  
S. V. Grigorev
Keyword(s):  
Acyclic Graphs ◽  
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 Expressive power of LL(k) Boolean grammars

2011 ◽  
Vol 412 (39) ◽  
pp. 5132-5155 ◽  
Author(s):  
Alexander Okhotin
Keyword(s):  
Expressive Power ◽  
Boolean Grammars

scholarly journals A game-theoretic characterization of Boolean grammars

2011 ◽  
Vol 412 (12-14) ◽  
pp. 1169-1183 ◽  
Author(s):  
Vassilis Kountouriotis ◽  
Christos Nomikos ◽  
Panos Rondogiannis
Keyword(s):  
Game Theoretic ◽  
Theoretic Characterization ◽  
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.

Load More ...
Sign in / Sign up

Export Citation Format

Share Document