9 citations · 40 across the 22 of their papers we have counts for
22 papers
Complexity of Simon's problem in classical sense
Hans Zantema
Simon's problem is a standard example of a problem that is exponential in classical sense, while it admits a polynomial solution in quantum computing. It is about a function fo…
Deadlock in packet switching networks
Anna Stramaglia, Jeroen J. A. Keiren, Hans Zantema
A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different n…
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…
The k-cube is k-representable
Bas Broere, Hans Zantema
A graph is called -representable if there exists a word over the nodes of the graph, each node occurring exactly times, such that there is an edge between two nodes $x,y…
Solving computational problems in the theory of word-representable graphs
Özgür Akgün, Ian P. Gent, Sergey Kitaev +1
A simple graph is word-representable if there exists a word over the alphabet such that letters and alternate in iff . Word-representable gra…
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…