185 citations · 321 across the 3 of their papers we have counts for
1 paper · 1 filter
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane +1
Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their conceptual extension is the non-deterministic finit…