Kernel: Python 3
context
.de_bruijn
(n
)
Create the "de Bruijn" automaton with states; it accepts word whose -th letter before the end is an 'a'. This family of automata is close to be being a worst case for determinization: its determinized automaton has states (not ).
Preconditions:
the labelset has at least two generators
Postconditions:
the Result is isomorphic to the derived-term automaton of .
See also:
Examples
In [1]:
In [2]:
The support of the determinized automaton is a de Bruijn graph:
In [3]:
In [4]: