Query automata over finite trees
- 28 March 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 275 (1-2), 633-674
- https://doi.org/10.1016/s0304-3975(01)00301-2
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Caterpillars: a context specification techniqueMarkup Languages: Theory and Practice, 2000
- A query language for XMLComputer Networks, 1999
- A logical view of structured filesThe VLDB Journal, 1998
- One-Unambiguous Regular LanguagesInformation and Computation, 1998
- Integrating contents and structure in text retrievalACM SIGMOD Record, 1996
- Graph Rewriting: An Algebraic and Logic ApproachPublished by Elsevier ,1990
- Domino-tiling gamesJournal of Computer and System Sciences, 1986
- A general theory of translationTheory of Computing Systems, 1969
- Automata on a 2-dimensional tapePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1967
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960