Abstract
The present chapter studies the regulation of grammatical parallelism so it defines parallel derivations over free monoids generated by finitely many strings. The grammatical parallelism is represented by E0L grammars (an EOL grammar is an ET0L grammar with a single set of rules). The chapter demonstrates that this regulation results into a large increase of the generative power of ordinary E0L grammars, even if the strings that generate free monoids consist of no more than two symbols. In fact, the E0L grammars regulated in this way are computationally complete. This chapter consists of two sections. Section 12.1 defines E0L grammars over word monoids. Section 12.2 demonstrates their computational completeness.
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
References
Meduna, A.: Symbiotic E0L systems. Acta Cybern. 10, 165–172 (1992)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Meduna, A., Zemek, P. (2014). Chapter 12 Parallel Rewriting Over Word Monoids. In: Regulated Grammars and Automata. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-0369-6_12
Download citation
DOI: https://doi.org/10.1007/978-1-4939-0369-6_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-0368-9
Online ISBN: 978-1-4939-0369-6
eBook Packages: Computer ScienceComputer Science (R0)