More on deterministic and nondeterministic finite cover automata.
Hermann GruberMarkus HolzerSebastian JakobiPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- finite automata
- deterministic automata
- probabilistic automata
- regular expressions
- finite automaton
- grammatical inference
- finite state
- finite state automaton
- tree automata
- turing machine
- fully observable
- regular languages
- black box
- randomized algorithms
- deterministic finite automata
- data sets
- cellular automata
- relaxation algorithm
- hidden markov models
- genetic algorithm
- machine learning
- databases