Abstract
It is shown that every conjunctive language is generated by a conjunctive grammar of a special form, in which every nonterminal A has at most one rule of the general form A ? a1&an, while the rest of the rules for A must be of the type A ? w, where w is a terminal string. For context-free grammars, a similar property does not hold (S. A. Greibach, W. Shi, S. Simonson, "Single tree grammars", 1992). © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Okhotin, A., & Reitwiener, C. (2009). Conjunctive grammars with restricted disjunction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 425–436). https://doi.org/10.1007/978-3-540-95891-8_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
