|
|
|
|
|
|
by 8uhaal
1170 days ago
|
|
|
Oh, interesting! Thanks for the pointer! But you can't always complement the language easily for an UFA either, right? The path to an accepting state may be unambiguous, but there could at the same time be a path to a non-accepting state, so flipping the states may keep some words in the language. And make the automaton even ambiguous. |
|
|