Automata with modulo counters and nondeterministic counter bounds.
Daniel ReidenbachMarkus L. SchmidPublished in: Kybernetika (2014)
Keyphrases
- finite automata
- finite state
- finite automaton
- upper bound
- probabilistic automata
- cellular automata
- upper and lower bounds
- lower bound
- tree automata
- regular expressions
- deterministic automata
- error bounds
- worst case
- model checking
- lower and upper bounds
- markov decision processes
- markov chain
- average case
- grammatical inference
- hidden markov models
- tight bounds
- timed automata
- objective function
- data mining
- finite state machines
- support vector
- genetic algorithm