Intersection
Intersection
The unique initial state
The unique initial state
Registers storing count value for accepting state.
Registers storing count value for accepting state.
The accepting condition
The accepting condition
The set of accepting states
The set of accepting states
Check whether the automaton accepts a given word.
Check whether the automaton accepts a given word.
Get any word accepted by this automaton, or None
if the language is empty
Get any word accepted by this automaton, or None
if the language is empty
Compute the length abstraction of this automaton.
Compute the length abstraction of this automaton.
Ask if state is accepting
Ask if state is accepting
Check whether this automaton accepts any word.
Check whether this automaton accepts any word.
Given a state, iterate over all outgoing transitons with vector
Given a state, iterate over all outgoing transitons with vector
Iterate over automaton states
Iterate over automaton states
Complementation
Complementation
Unique lengths of accepted words
Unique lengths of accepted words
Compute states that can only be reached through words with some unique length
Compute states that can only be reached through words with some unique length
Union
Union