Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.
Descriptional and computational co mplexity of finite automata—A survey
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2verdicts
UNVERDICTED 2representative citing papers
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
citing papers explorer
-
Deconstructing Subset Construction -- Reducing While Determinizing
Proposes embedding on-the-fly minimization via equivalence registries into subset construction and Brzozowski's algorithm for NFA canonization, with empirical improvements on automatic sequences and an open-source implementation.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.