Abstract
In terms of algebra, the context-free and E0L grammatical derivations are traditionally defined over the free monoids generated by total alphabets of these grammars under the operation of concatenation. The present chapter, however, introduces and investigates these derivations over different algebraic structures in order to increase the generative power of these grammars.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
A. Meduna, Context free derivations on word monoids. Acta Informatica 27, 781–786 (1990)
A. Meduna, Syntactic complexity of scattered context grammars. Acta Informatica 32, 285–298 (1995)
A. Meduna, D. Kolář, Homogenous grammars with a reduced number of non-context-free productions. Inf. Process. Lett. 81, 253–257 (2002)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Meduna, A., Soukup, O. (2017). Algebra, Grammars, and Computation. In: Modern Language Models and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-63100-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-63100-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-63099-1
Online ISBN: 978-3-319-63100-4
eBook Packages: Computer ScienceComputer Science (R0)