String-rewriting systems
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Extended finite automata over groups
Discrete Applied Mathematics
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
A Generalisation of Parikh's Theorem in Formal Language Theory
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Rational subsets of polycyclic monoids and valence automata
Information and Computation
Adding monotonic counters to automata and transition graphs
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
| Hi-index | 0.00 |
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.