4 citations · 6 across the 2 of their papers we have counts for
1 paper · 1 filter
León Bohn, Yong Li, Christof Löding +1
Families of deterministic finite automata (FDFA) represent regular ω-languages through their ultimately periodic words (UP-words). An FDFA accepts pairs of words, where the first…