Synchronizing deterministic push-down automata can be really hard
The question if a deterministic finite automaton admits a software reset in the form of a so-
called synchronizing word can be answered in polynomial time. In this paper, we extend this …
called synchronizing word can be answered in polynomial time. In this paper, we extend this …
Synchronization of Parikh Automata
S Hoffmann - … Conference on Developments in Language Theory, 2023 - Springer
Synchronizability of automata has been investigated and extended to various models. Here,
we investigate notions of synchronizability for Parikh automata, ie, automata with counters …
we investigate notions of synchronizability for Parikh automata, ie, automata with counters …