Skip to main content
Log in

Conjunctive Grammars and Systems of Language Equations

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

REFERENCES

  1. 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.

  2. 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.

  3. Okhotin, A., Conjunctive Grammars, J. Automata, Languages and Combinatorics, 2001, vol. 6, no. 4, pp. 519-535.

    Google Scholar 

  4. Okhotin, A., Top-Down Parsing of Conjunctive Languages, Grammars, 2002, vol. 5, no. 1, pp. 21-40.

    Google Scholar 

  5. Okhotin, A., A Recognition and Parsing Algorithm for Arbitrary Conjunctive Grammars, Theor. Comput. Sci. C, in press.

  6. Okhotin, A., LR Parsing for Conjunctive Grammars, Grammars, 2002, vol. 5, no. 2, pp. 81-125.

    Google Scholar 

  7. 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.

  8. 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.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020213411126

Keywords

Navigation