1 paper
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…