Abstract
The last chapter of this book discusses algebraic power series and their relation to context-free grammars and languages. The notion Aalg«∑*» was already defined above in connection with pushdown automata in Section 10. We now consider the series in this collection from a new angle, corresponding to defining equations. The defining equations are algebraic in the classical sense, i.e., polynomial equations. However, their rather specific form reflects the particular requirements for context-free grammars.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kuich, W., Salomaa, A. (1986). Algebraic Systems. In: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69959-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-69959-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69961-0
Online ISBN: 978-3-642-69959-7
eBook Packages: Springer Book Archive