Results 1  10
of
13
Automaton Representation of Linear Conjunctive Languages
 Developments in Language Theory (Proc. of DLT 2002), LNCS
, 2002
"... This paper introduces a new family of automata that turns out to be computationally equivalent to linear conjunctive grammars  which are linear contextfree grammars extended with an explicit intersection operation. ..."
Abstract

Cited by 11 (9 self)
 Add to MetaCart
(Show Context)
This paper introduces a new family of automata that turns out to be computationally equivalent to linear conjunctive grammars  which are linear contextfree grammars extended with an explicit intersection operation.
The Hardest Linear Conjunctive Language
 Information Processing Letters
"... This paper demonstrates that the Pcomplete language of yesinstances of Circuit Value Problem under a suitable encoding can be generated by a linear conjunctive grammar, or, equivalently, accepted by a triangular trellis automaton. This result has several implications on the properties of the langu ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
This paper demonstrates that the Pcomplete language of yesinstances of Circuit Value Problem under a suitable encoding can be generated by a linear conjunctive grammar, or, equivalently, accepted by a triangular trellis automaton. This result has several implications on the properties of the languages generated by conjunctive grammars of the general form and on the relationship between the abstract models of parallel computation.
State Complexity of Linear Conjunctive Languages
 Preproceedings of DCFS 2002
, 2002
"... The languages generated by linear conjunctive grammars have been recently proved to have a simple automaton characterization. This paper begins the study of the descriptional complexity of this language family by obtaining several results on number of states in these automata. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
The languages generated by linear conjunctive grammars have been recently proved to have a simple automaton characterization. This paper begins the study of the descriptional complexity of this language family by obtaining several results on number of states in these automata.
Efficient AutomatonBased Recognition for Linear Conjunctive Languages
"... 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 con ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
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.
On the Number of Nonterminals in Linear Conjunctive Grammars
, 2003
"... This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same language and contains exactly 2 nonterminals. This upper bound is shown to be precise by proving that some languages cannot be denoted using a single nonterminal.
On a New Family of Automata
, 2002
"... This paper introduces a new family of automata that turns out to be computationally equivalent to linear conjunctive grammars. ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
This paper introduces a new family of automata that turns out to be computationally equivalent to linear conjunctive grammars.
A Linear Conjunctive Grammar for the Circuit Value Problem
, 2002
"... In this paper we show that the Pcomplete language of yesinstances of Circuit Value Problem under a certain supplied encoding can be generated by a linear conjunctive grammar. Contents 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we show that the Pcomplete language of yesinstances of Circuit Value Problem under a certain supplied encoding can be generated by a linear conjunctive grammar. Contents 1
On the Number of Nonterminals in Linear Conjunctive
"... This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same ..."
Abstract
 Add to MetaCart
(Show Context)
This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same language and contains exactly 2 nonterminals. This upper bound is shown to be precise by proving that some languages cannot be denoted using a single nonterminal.
An Overview of Conjunctive Grammars
, 2003
"... Conjunctive grammars were introduced in 2000 as a generalization of contextfree grammars that allows the use of an explicit intersection operation in rules. Several theoretical results on their properties have been obtained since then, and a number of efficient parsing algorithms that justify th ..."
Abstract
 Add to MetaCart
(Show Context)
Conjunctive grammars were introduced in 2000 as a generalization of contextfree grammars that allows the use of an explicit intersection operation in rules. Several theoretical results on their properties have been obtained since then, and a number of efficient parsing algorithms that justify the practical value of the concept have been developed. This article reviews these results and proposes numerous open problems.
Homomorphic and Inverse Homomorphic Images of Linear Conjunctive Languages
"... The paper continues the study of the closure properties of the languages generated by linear conjunctive grammars. It is proved that this language family is closed under inverse homomorphism, but not closed under homomorphism and even under epsilonfree homomorphism. However, there are some particul ..."
Abstract
 Add to MetaCart
The paper continues the study of the closure properties of the languages generated by linear conjunctive grammars. It is proved that this language family is closed under inverse homomorphism, but not closed under homomorphism and even under epsilonfree homomorphism. However, there are some particular homomorphisms under which this family is in fact closed, and the present paper develops a complete characterization of this class of homomorphisms. Combined with the earlier results...