Probabilistic Conjunctive Grammar

2017 ◽  
pp. 119-127 ◽  
Author(s):  
K. Kanchan Devi ◽  
S. Arumugam
Keyword(s):  
Conjunctive Grammar

FUZZY CONJUNCTIVE GRAMMAR AND FUZZY SYNCHRONIZED ALTERNATING PUSHDOWN AUTOMATA

2020 ◽  
Vol 9 (11) ◽  
pp. 9463-9480
Author(s):  
R. Pathrakumar ◽  
M. Rajasekar
Keyword(s):  
Pushdown Automata ◽  
Conjunctive Grammar

CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES

2008 ◽  
Vol 19 (03) ◽  
pp. 597-615 ◽  
Author(s):  
ARTUR JEŻ
Keyword(s):  
Negative Answer ◽  
The Body ◽  
Regular Languages ◽  
Natural Numbers ◽  
Open Problems ◽  
Conjunctive Grammars ◽  
Unary Languages ◽  
Context Free ◽  
Conjunctive Grammar ◽  
Context Free Grammars

Conjunctive grammars, introduced by Okhotin, extend context-free grammars by an additional operation of intersection in the body of any production of the grammar. Several theorems and algorithms for context-free grammars generalize to the conjunctive case. Okhotin posed nine open problems concerning those grammars. One of them was a question, whether a conjunctive grammars over a unary alphabet generate only regular languages. We give a negative answer, contrary to the conjectured positive one, by constructing a conjunctive grammar for the language {a4n : n ∈ ℕ}. We also generalize this result: for every set of natural numbers L we show that {an : n ∈ L} is a conjunctive unary language, whenever the set of representations in base-k system of elements of L is regular, for arbitrary k.

EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES

2003 ◽  
Vol 14 (06) ◽  
pp. 1103-1116 ◽  
Author(s):  
ALEXANDER OKHOTIN
Keyword(s):  
Finite Automata ◽  
Efficient Algorithms ◽  
Regular Expressions ◽  
Conjunctive Grammars ◽  
Human Use ◽  
Conjunctive Grammar

Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. This paper studies efficient algorithms for converting a linear conjunctive grammar to an equivalent triangular trellis automaton, and also proposes a number of techniques of reducing the size of these automata.

Sign in / Sign up

Export Citation Format

Share Document