CORR
2009
Springer
13 years 9 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...