113 search results - page 16 / 23 » 2-Visibly Pushdown Automata |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
APAL
2006
13 years 7 months ago
2006
EMNLP
2011
12 years 7 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
FSTTCS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...