Flip-pushdown automata: nondeterministic ε-moves can be removed.
Pavol DurisMarek KostaPublished in: ITAT (2011)
Keyphrases
- finite state
- finite automata
- model checking
- finite automaton
- markov chain
- tree automata
- probabilistic automata
- deterministic automata
- cellular automata
- regular expressions
- markov decision processes
- finite state machines
- regular languages
- data sets
- bayesian networks
- temporal logic
- finite state automata
- timed automata
- artificial intelligence
- lattice gas
- machine learning