Silent Transitions in Automata with Storage
We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step. We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid. This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of silent transitions. Both classes are defined by graph products of copies of the bicyclic monoid and the group of integers. The first class contains pushdown storages as well as the blind counters while the second class contains the blind and the partially blind counters.
KeywordsInput Symbol Storage Mechanism Input Word Membership Problem Commutative Monoid
Unable to display preview. Download preview PDF.
- 5.Gilman, R.H.: Formal Languages and Infinite Groups. In: Geometric and Computational Perspectives on Infinite Groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 25 (1996)Google Scholar
- 11.Jantzen, M.: Eigenschaften von Petrinetzsprachen. German. PhD thesis. Universität Hamburg (1979)Google Scholar