35 search results - page 1 / 7 » Equivalence of Deterministic Nested Word to Word Transducers |
FCT
2009
Springer
14 years 5 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identiļ¬ed with...
DLT
2010
13 years 11 months ago
2010
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
FCT
2009
Springer
14 years 5 months ago
2009
Springer
MFCS
2009
Springer
14 years 5 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ļ...