Typechecking Top-Down Uniform Unranked Tree Transducers
Authors:
- 16 December 2002
- book chapter
- Published by Springer Nature
- p. 64-78
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Automata theory for XML researchersACM SIGMOD Record, 2002
- A formal model for an expressive fragment of XSLTInformation Systems, 2002
- Query automata over finite treesTheoretical Computer Science, 2002
- The XML typechecking problemACM SIGMOD Record, 2002
- UnQL: a query language and algebra for semistructured data based on structural recursionThe VLDB Journal, 2000
- Haskell overloading is DEXPTIME-completeInformation Processing Letters, 1994
- Deciding Equivalence of Finite Tree AutomataSIAM Journal on Computing, 1990
- A note on the reduction of two-way automata to one-way automataInformation Processing Letters, 1989
- Macro tree transducersJournal of Computer and System Sciences, 1985
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974