7 citations · 11 across the 6 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2009★ 3 cited
On the Shuffle Automaton Size for Words
Franziska Biegler, Mark Daley, Ian McQuillan
We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u shuffled with v requires an exponential number o…
cs.FL2009★ 1 cited
State complexity of orthogonal catenation
Mark Daley, Michael Domaratzki, Kai Salomaa
A language is the orthogonal catenation of languages and if every word of can be written in a unique way as a catenation of a word in and a word in .…