Boolean grammar

Boolean grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Graph data models are widely used in different areas of computer science such as bioinformatics, graph databases, social networks…

2015

We propose an enhancement to current parsing and transformation systems by leveraging the expressive power of Boolean grammars, a…

2014

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete…

2010

In this thesis we examine four interesting classes of formal languages. The two of them, namely the regular and context-free ones…

2009

The linear case of context-free, conjunctive and Boolean grammars. Trellis automata. Examples. Equivalence of grammars and…

Review

2007

Review

2007

Conjunctive grammars are context-free grammars with an explicit conjunction operation in the formalism of rules; Boolean grammars…

2007