Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
| Hi-index | 0.01 |
A "Badly Nondeterministic" (BN) n-state acceptor is a machine for which any deterministic finite state acceptor for the same language requires 2n states. A family of such machines, attributed to G. Ott, was described in (1). Taking liberties with the notation of that paper, we will call the family {Rn}n0 (see figure below). Another family of BN automata, which we will call {Bn}n0, was described in (2). These latter BN automata are the subject of this note.