Hierarchy of Reversal and Zerotesting Bounded Multicounter Machines
Proceedings of the Mathematical Foundations of Computer Science 1984
Formal languages and their relation to automata
Formal languages and their relation to automata
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Consensual Definition of Languages by Regular Sets
Language and Automata Theory and Applications
Strict local testability with consensus equals regularity
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
For the classical family of languages recognized by quasi-realtime deterministic multi-counter machines of the partially blind type, we propose a new implementation by means of matching finite-state computations, within the model of consensually regular languages (recently introduced by the authors), whose properties are summarized. A counter machine computation is mapped on multiple DFA computations that must match in a precise sense. Such implementation maps the original counters onto a multiset over the states of the DFA. By carefully synchronizing and mutually excluding counter operations, we prove that the union of such counter languages is also consensual. This approach leads to a new way of specifying counter languages by means of regular expressions that define matching computations.