2 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Janusz Brzozowski, Hellis Tamm
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "átomaton", whose states are the "atoms" of the language, that is, non-e…