Descriptional Complexity of Deterministic Finite Automata with Multiple Initial States.

Published in: J. Autom. Lang. Comb. (2000)

Keyphrases

combining multiple
deterministic finite automata
regular expressions
neural network
case study
worst case
relational databases
machine learning
information systems
clustering algorithm
computational complexity
information extraction
space complexity