9 citations · 40 across the 22 of their papers we have counts for
5 papers · 1 filter
Counting symbol switches in synchronizing automata
Henk Don, Hans Zantema
Instead of looking at the lengths of synchronizing words as in Černý's conjecture, we look at the switch count of such words, that is, we only count the switches from one letter to…
Lower Bounds for Synchronizing Word Lengths in Partial Automata
Michiel de Bondt, Henk Don, Hans Zantema
It was conjectured by Černý in 1964, that a synchronizing DFA on states always has a synchronizing word of length at most , and he gave a sequence of DFAs for which th…
Slowly synchronizing automata with fixed alphabet size
Michiel de Bondt, Henk Don, Hans Zantema
It was conjectured by Černý in 1964 that a synchronizing DFA on states always has a shortest synchronizing word of length at most , and he gave a sequence of DFAs for…
The Degree of Squares is an Atom (Extended Version)
Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks +1
We answer an open question in the theory of degrees of infinite sequences with respect to transducibility by finite-state transducers. An initial study of this partial order of deg…
Combining Insertion and Deletion in RNA-editing Preserves Regularity
E. P. de Vink, H. Zantema, D. Bošnački
Inspired by RNA-editing as occurs in transcriptional processes in the living cell, we introduce an abstract notion of string adjustment, called guided rewriting. This formalism all…