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.
Similar content being viewed by others
References
Dassow, J., Paun, G.: Regulated rewriting in formal language theory. New York: Springer 1989
Geffert, V.: How to generate languages using only two pairs of parentheses. J. Inform. Process. Cybernet. EIK27, 781–786 (1990)
Gruska, J.: On a classification of context-free languages. Kybernetika 13, 22–29 (1967)
Meduna, A.: Context free derivations on word monoids. Acta Informatica 27, 781–786 (1990)
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/s002360050052