Reachability in Succinct and Parametric One-Counter Automata.
Christoph HaaseStephan KreutzerJoël OuaknineJames WorrellPublished in: CONCUR (2009)
Keyphrases
- cellular automata
- finite automata
- transitive closure
- state space
- neural network
- regular expressions
- artificial neural networks
- database
- multiresolution
- social networks
- finite state machines
- tree automata
- finite state automata
- probabilistic automata
- reinforcement learning
- face recognition
- decision trees
- parametric models
- finite state
- artificial intelligence
- lattice gas