Nondeterminism and succinctly representable regular languages
Lynette van Zijl · South African Institute of Computer Scientists and Information Technologists · 2002
Only a relatively small number of families of regular languages can be represented succinctly by nondeterministic finite state machines. We conduct both experimental and theoretical analyses on selective nondeterministic finite automata, or *-NFAs, and show that this class of nondeterministic automata can be used for the succinct representation of a far larger number of regular languages.