Summary
The notion of a (direct) derivation is introduced on word monoids generated by finite languages over total vocabularies of context free grammars. It is shown that using generators of the length at most two, context sensitive and recursively enumerable languages can be characterized in a natural manner.
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. Berlin: Akademie-Verlag 1989
Kral, J.: A note on grammars with regular restrictions. Kybernetika 9, 159–161 (1973)
Navratil, E.: Context-free grammars with regular conditions. Kybernetika 2, 118–126 (1970)
Paun, Gh.: On the generative capacity of conditional grammars. Inf. Control 43, 178–186 (1979)
Penttonen, M.: One-sided and two-sided context in formal grammars. Inf. Control 25, 371–392 (1974)
Salomaa, A.: Formal languages. New York: Academic Press 1973
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meduna, A. Context free derivations on word monoids. Acta Informatica 27, 781–786 (1990). https://doi.org/10.1007/BF00264286
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264286