An upper bound for transforming self-verifying automata into deterministic ones.
Ira AssentSebastian SeibertPublished in: RAIRO Theor. Informatics Appl. (2007)
Keyphrases
- upper bound
- finite state automaton
- lower bound
- turing machine
- worst case
- branch and bound
- upper and lower bounds
- branch and bound algorithm
- lower and upper bounds
- randomized algorithms
- linear functions
- deterministic finite automata
- model checking
- finite automata
- generalization error
- cellular automata
- black box
- data sets
- regular expressions
- sample complexity
- lattice gas
- np hard
- data model
- information retrieval
- machine learning
- probabilistic automata
- real time
- deterministic automata