Automata for XML -- a survey
From MaRDI portal
Publication:878749
DOI10.1016/J.JCSS.2006.10.003zbMATH Open1115.68101OpenAlexW2092398161MaRDI QIDQ878749FDOQ878749
Authors: Thomas Schwentick 
Publication date: 26 April 2007
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2006.10.003
Recommendations
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- Title not available (Why is that?)
- Visibly pushdown languages
- Title not available (Why is that?)
- Query automata over finite trees
- Attribute grammars for unranked trees as a query language for structured documents
- Expressiveness of structured document query languages based on attribute grammars
- Deciding Equivalence of Finite Tree Automata
- The complexity of XPath query evaluation and XML typing
- Conjunctive queries over trees
- Title not available (Why is that?)
- Fundamentals of Computation Theory
- Containment and equivalence for a fragment of XPath
- Monadic Datalog and the expressive power of languages for web information extraction
- Title not available (Why is that?)
- Rewriting Techniques and Applications
- STACS 2005
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Translations on a context free grammar
- The complexity of first-order and monadic second-order logic revisited
- Finite-memory automata
- XML queries and constraints, containment and reformulation
- An algebraic approach to data languages and timed languages
- Tree acceptors and some of their applications
- XML with data values: Typechecking revisited.
- A comparison of pebble tree transducers with macro tree transducers
- Typechecking for XML transformers
- On the power of tree-walking automata.
- Parallel and two-way automata on directed ordered acyclic graphs
- Minimal Ascending and Descending Tree Automata
- Database Theory - ICDT 2005
- Developments in Language Theory
- Tree transducers, L systems, and two-way machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree-walking automata do not recognize all regular languages
- Title not available (Why is that?)
- One-unambiguous regular languages
- Finite state machines for strings over infinite alphabets
- Title not available (Why is that?)
- Automata, Languages and Programming
- Title not available (Why is that?)
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Database Programming Languages
- Frontiers of tractability for typechecking simple XML transformations
- A formal model for an expressive fragment of XSLT
- Title not available (Why is that?)
- Typechecking XML views of relational databases
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
- Automata, Languages and Programming
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2004
- Regular expression pattern matching for XML
- Title not available (Why is that?)
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Caterpillars, context, tree automata and tree pattern matching
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- CONCUR 2004 - Concurrency Theory
- Automata, Languages and Programming
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Title not available (Why is that?)
- XPath and modal logics of finite DAG's
- On two-way tree automata
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Science Logic
- Database Theory - ICDT 2005
Cited In (35)
- Evolving schemas for streaming XML
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Highly expressive query languages for unordered data trees
- XML compression via directed acyclic graphs
- Efficient inclusion checking for deterministic tree automata and XML schemas
- On characterization of fuzzy tree pushdown automata
- State complexity of the concatenation of regular tree languages
- Title not available (Why is that?)
- Lower bounds for the size of deterministic unranked tree automata
- Polynomial-time equivalence testing for deterministic fresh-register automata
- XML schema, tree logic and sheaves automata
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- Tree Automata with Global Constraints
- Deterministic top-down tree automata: past, present, and future
- State complexity of Kleene-star operations on trees
- State trade-offs in unranked tree automata
- On-the-fly bisimilarity checking for fresh-register automata
- Operational state complexity of nested word automata
- Reasoning about XML with temporal logics and automata
- Leafy automata for higher-order concurrency
- Parameterized complexity of basic decision problems for tree automata
- Synchronizing relations on words
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Learning Tree Languages
- Rewriting of visibly pushdown languages for XML data integration
- Regular expressions for data words
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- The weighted HOM-problem over fields
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- Active XML document rewriting based on tree automata theory
- Foundations of XML processing. The tree-automata approach.
- Tree automata with global constraints
- One-variable context-free hedge automata
Uses Software
This page was built for publication: Automata for XML -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878749)
