Synchronizing Deterministic Push-Down Automata Can Be Really Hard.
Henning FernauPetra WolfTomoyuki YamakamiPublished in: MFCS (2020)
Keyphrases
- finite state automaton
- turing machine
- deterministic finite automata
- finite state
- neural network
- cellular automata
- database
- machine learning
- image processing
- dynamic programming
- finite state machines
- finite automata
- black box
- probabilistic automata
- randomized algorithms
- computationally hard
- reinforcement learning
- knowledge base
- information systems
- databases