Unboundedness and downward closures of higher-order pushdown automata.
Matthew HagueJonathan KochemsC.-H. Luke OngPublished in: POPL (2016)
Keyphrases
- higher order
- high order
- cellular automata
- finite state
- natural images
- pairwise
- model checking
- finite automata
- finite state machines
- low order
- markov random field
- probabilistic automata
- markov models
- lattice gas
- closed sets
- transitive closure
- regular expressions
- tree automata
- information retrieval
- conditional random fields
- probabilistic model
- hidden markov models
- knowledge base
- social networks
- finite state automata
- genetic algorithm