Some subclasses of context-free languages in NC1
Information Processing Letters
The Unsolvability of the Recognition of Linear Context-Free Languages
Journal of the ACM (JACM)
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
Gesellschaft für Informatik e.V., 3. Jahrestagung
On the Complexities of Linear LL(1) and LR(1) Grammars
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
On Strongly Context-Free Languages
On Strongly Context-Free Languages
The hardest linear conjunctive language
Information Processing Letters
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
Information and Computation
State complexity of linear conjunctive languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Conjunctive Grammars and Alternating Pushdown Automata
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Homomorphisms preserving linear conjunctive languages
Journal of Automata, Languages and Combinatorics
Information and Computation
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Efficient automaton-based recognition for linear conjunctive languages
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Linear conjunctive grammars and one-turn synchronized alternating pushdown automata
FG'09 Proceedings of the 14th international conference on Formal grammar
Hi-index | 5.23 |
Linear conjunctive grammars are conjunctive grammars in which the body of each conjunct contains no more than a single nonterminal symbol. They can at the same time be thought of as a special case of conjunctive grammars and as a generalization of linear context-free grammars that provides an explicit intersection operation.Although the set of languages generated by these grammars is known to include many important noncontext-free languages, linear conjunctive languages are still all square-time, and several practical algorithms have been devised to handle them, which makes this class of grammars quite suitable for use in applications.In this paper we investigate the closure properties of the language family generated by linear conjunctive grammars; the main result is its closure under complement, which implies that it is closed under all set-theoretic operations. We also consider several cases in which the concatenation of two linear conjunctive languages is certain to be linear conjunctive. In addition, it is demonstrated that linear conjunctive languages are closed under quotient with finite languages, not closed under quotient with regular languages, and not closed under ε-free homomorphism.