Unboundedness and Downwards Closures of Higher-Order Pushdown Automata.
Matthew HagueJonathan KochemsC.-H. Luke OngPublished in: CoRR (2015)
Keyphrases
- higher order
- high order
- pairwise
- finite state
- natural images
- markov random field
- cellular automata
- model checking
- finite state machines
- regular expressions
- markov models
- conditional random fields
- low order
- lower order
- tree automata
- timed automata
- probabilistic automata
- finite automata
- lattice gas
- transitive closure
- neural network
- real time
- image segmentation
- case study
- data sets
- anti unification