Automata with Modulo Counters and Nondeterministic Counter Bounds.
Daniel ReidenbachMarkus L. SchmidPublished in: CIAA (2012)
Keyphrases
- finite automata
- finite state
- finite automaton
- upper bound
- lower bound
- probabilistic automata
- tree automata
- markov chain
- regular expressions
- deterministic automata
- lower and upper bounds
- error bounds
- model checking
- cellular automata
- markov decision processes
- upper and lower bounds
- confidence bounds
- tight bounds
- finite state machines
- vc dimension
- grammatical inference
- worst case
- data mining
- databases
- website
- rates of convergence
- finite state automata
- hidden markov models
- theoretical guarantees
- model selection