On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids
During recent decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to exceed the capacity of the original model. Furthermore, we investigate when, in the extended automata model, the nondeterministic variant differs from the deterministic one in capacity. We show that all these conditions are in fact equivalent and present an algebraic characterization. In particular, the open question of whether every language generated by a valence grammar over a finite monoid is context-free is provided with a positive answer.
KeywordsLinear Extension Regular Language Derivation Tree Left Inverse Valence Tree
Unable to display preview. Download preview PDF.
- 2.Dassow, J., Turaev, S.: Petri net controlled grammars: the power of labeling and final markings. Romanian Journal of Information Science and Technology 12(2), 191–207 (2009)Google Scholar
- 3.Fernau, H., Stiebe, R.: Valence grammars with target sets. In: Words, Semigroups, and Transductions. World Scientific, Singapore (2001)Google Scholar
- 12.Render, E.: Rational Monoid and Semigroup Automata. PhD thesis, University of Manchester (2010)Google Scholar