113 search results - page 20 / 23 » Height-Deterministic Pushdown Automata |
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
FCT
1991
Springer
13 years 11 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Monolithic ļ¬nite-state probabilistic programs have been abstractly modeled by ļ¬nite Markov chains, and the algorithmic veriļ¬cation problems for them have been inves...
CC
1999
Springer
13 years 11 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
COGSCI
2010
13 years 7 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...