Three families of maximally nondeterministic automata
T Tom Verhoeff · TU/e Research Portal · 1987
For every nondeterministic finite state machine there exists an equivalent deterministic automaton.Such an equivalent automaton can be obtained by the subset construction.An automaton may be called maxirrwlly rwndeterministic when the subset construction yields a minimal automaton.This note presents three nice families of maximally nondeterministic automata together with some variations.The languages concerned are all prefix-closed.