The Hardest Language for Conjunctive Grammars

Path Querying with Conjunctive Grammars by Matrix Multiplication

Programming and Computer Software ◽

10.1134/s0361768819070041 ◽

2019 ◽

Vol 45 (7) ◽

pp. 357-364

Author(s):

R. Azimov ◽

S. Grigorev

Keyword(s):

Matrix Multiplication ◽

Conjunctive Grammars

Download Full-text

BOOLEAN GRAMMARS AND GSM MAPPINGS

International Journal of Foundations of Computer Science ◽

10.1142/s0129054110007568 ◽

2010 ◽

Vol 21 (05) ◽

pp. 799-815 ◽

Cited By ~ 8

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.

Download Full-text

Distributional learning of conjunctive grammars and contextual binary feature grammars

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2017.07.004 ◽

2019 ◽

Vol 104 ◽

pp. 359-374 ◽

Cited By ~ 2

Author(s):

Ryo Yoshinaka

Keyword(s):

Conjunctive Grammars ◽

Binary Feature ◽

Distributional Learning

Download Full-text

Learning Conjunctive Grammars and Contextual Binary Feature Grammars

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-319-15579-1_49 ◽

2015 ◽

pp. 623-635 ◽

Cited By ~ 3

Author(s):

Ryo Yoshinaka

Keyword(s):

Conjunctive Grammars ◽

Binary Feature

Download Full-text

Unambiguous conjunctive grammars over a one-symbol alphabet

Theoretical Computer Science ◽

10.1016/j.tcs.2016.12.009 ◽

2017 ◽

Vol 665 ◽

pp. 13-39 ◽

Cited By ~ 2

Author(s):

Artur Jeż ◽

Alexander Okhotin

Keyword(s):

Conjunctive Grammars

Download Full-text

Whale Calf, a Parser Generator for Conjunctive Grammars

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/3-540-44977-9_20 ◽

2003 ◽

pp. 213-220 ◽

Cited By ~ 2

Author(s):

Alexander Okhotin

Keyword(s):

Conjunctive Grammars ◽

Parser Generator

Download Full-text

Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Computer Science – Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74510-5_19 ◽

2007 ◽

pp. 168-181 ◽

Cited By ~ 4

Author(s):

Artur Jeż ◽

Alexander Okhotin

Keyword(s):

Conjunctive Grammars

Download Full-text

Unambiguous Conjunctive Grammars over a One-Letter Alphabet

Developments in Language Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-642-38771-5_25 ◽

2013 ◽

pp. 277-288 ◽

Cited By ~ 1

Author(s):

Artur Jeż ◽

Alexander Okhotin

Keyword(s):

Letter Alphabet ◽

Conjunctive Grammars

Download Full-text

Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives

Formal Grammar - Lecture Notes in Computer Science ◽

10.1007/978-3-642-39998-5_15 ◽

2013 ◽

pp. 242-249 ◽

Cited By ~ 4

Author(s):

Stepan Kuznetsov

Keyword(s):

Normal Form ◽

Lambek Calculus ◽

Conjunctive Grammars ◽

Greibach Normal Form

Download Full-text

CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES

International Journal of Foundations of Computer Science ◽

10.1142/s012905410800584x ◽

2008 ◽

Vol 19 (03) ◽

pp. 597-615 ◽

Cited By ~ 40

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.

Download Full-text