Is it theoretically possible to have a nondeterministic finite state machine without any initial state or does it need at least one initial state?
Nondeterministic finite state machine without any initial state possible
formal languages;regular languages;finite automata;nondeterminism