Abstract
This paper studies systems of language equations that are resolved with respect to variables and contain the operations of concatenation, union and intersection. Every system of this kind is proved to have a least fixed point, and the equivalence of these systems to conjunctive grammars is established. This allows us to obtain an algebraic characterization of the language family generated by conjunctive grammars.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.REFERENCES
Okhotin, A.S., On Augmenting the Formalism of Context-free Grammars with an Intersection Operation, Proc. of the IV Int. Conf. “Discrete Models in the Control System Theory,” 2000, pp. 106-109.
Okhotin, A., Conjunctive Grammars, Pre-proceedings of DCAGRS 2000; Techn. report of Dept. of Computer Science, University of Western Ontario, London, Ontario, Canada, 2000, no. 555.
Okhotin, A., Conjunctive Grammars, J. Automata, Languages and Combinatorics, 2001, vol. 6, no. 4, pp. 519-535.
Okhotin, A., Top-Down Parsing of Conjunctive Languages, Grammars, 2002, vol. 5, no. 1, pp. 21-40.
Okhotin, A., A Recognition and Parsing Algorithm for Arbitrary Conjunctive Grammars, Theor. Comput. Sci. C, in press.
Okhotin, A., LR Parsing for Conjunctive Grammars, Grammars, 2002, vol. 5, no. 2, pp. 81-125.
Okhotin, A.S., On P-Completeness of the Membership Problem for Conjunctive Grammars, Proc. of the Int. Workshop on Discrete Mathematics and Mathematical Cybernetics, Ratmino, 2001.
Sudborough, I.H., A Note on Tape-bounded Complexity Classes and Linear Context-free Languages, J. ACM, 1975, vol. 22, no. 4, pp. 499-500.
Autebert, J., Berstel, J., and Boasson, L., Context-Free Languages and Pushdown Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 111-174.
Kuich, W., Semirings and Formal Power Series: Their Relevance to Formal Language and Automata, in Handbook of Formal Languages, Berlin: Springer, 1997, vol. 1, pp. 609-677.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Okhotin, A.S. Conjunctive Grammars and Systems of Language Equations. Programming and Computer Software 28, 243–249 (2002). https://doi.org/10.1023/A:1020213411126
Issue Date:
DOI: https://doi.org/10.1023/A:1020213411126