Skip to main content
Springer Nature Link
Log in

Syntactic complexity of context-free grammars over word monoids

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The syntactic complexity of context-free grammars defined over word monoids is investigated. It is demonstrated that every recursively enumerable language can be defined by a ten-nonterminal context-free grammar over a word monoid generated by an alphabet and six words of length two. Open problems are formulated.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dassow, J., Paun, G.: Regulated rewriting in formal language theory. New York: Springer 1989

    Google Scholar 

  2. Geffert, V.: How to generate languages using only two pairs of parentheses. J. Inform. Process. Cybernet. EIK27, 781–786 (1990)

    Google Scholar 

  3. Gruska, J.: On a classification of context-free languages. Kybernetika 13, 22–29 (1967)

    MathSciNet  Google Scholar 

  4. Meduna, A.: Context free derivations on word monoids. Acta Informatica 27, 781–786 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Center at Technical University of Brno, Udolni 19, CZ-60000, Brno, Czech Republic

    Alexander Meduna

Authors
  1. Alexander Meduna
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meduna, A. Syntactic complexity of context-free grammars over word monoids. Acta Informatica 33, 457–462 (1996). https://doi.org/10.1007/s002360050052

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050052

Keywords