Login / Signup
Minimalizations of NFA Using the Universal Automaton.
Libor Polák
Published in:
CIAA (2004)
Keyphrases
</>
deterministic finite automata
finite state automata
deterministic finite automaton
turing machine
regular expressions
tree automata
hybrid automata
finite state machines
finite automata
case study
information systems
genetic algorithm
data sets
association rules
multiscale
kolmogorov complexity
decision trees