Typing and querying XML documents
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 167-178
- https://doi.org/10.1145/773153.773170
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- The complexity of acyclic conjunctive queriesJournal of the ACM, 2001
- One-Unambiguous Regular LanguagesInformation and Computation, 1998
- Counting Quantifiers, Successor Relations, and Logarithmic SpaceJournal of Computer and System Sciences, 1997
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- On the relative complexity of some languages in NC1Information Processing Letters, 1989
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Translations on a context free grammarInformation and Control, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Parenthesis GrammarsJournal of the ACM, 1967