Login / Signup
Minimalizations of NFA using the universal automaton.
Libor Polák
Published in:
Int. J. Found. Comput. Sci. (2005)
Keyphrases
</>
deterministic finite automata
finite state automata
turing machine
deterministic finite automaton
regular expressions
database
hybrid automata
genetic algorithm
pattern matching
finite state machines
information systems
database systems
digital libraries
multiresolution
string matching
finite automaton