Recommendations
Cites work
- scientific article; zbMATH DE number 1722707 (Why is no real title available?)
- scientific article; zbMATH DE number 3586493 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- scientific article; zbMATH DE number 1354852 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1953124 (Why is no real title available?)
- scientific article; zbMATH DE number 1953131 (Why is no real title available?)
- scientific article; zbMATH DE number 1953139 (Why is no real title available?)
- scientific article; zbMATH DE number 1953140 (Why is no real title available?)
- scientific article; zbMATH DE number 1954390 (Why is no real title available?)
- scientific article; zbMATH DE number 2043533 (Why is no real title available?)
- scientific article; zbMATH DE number 2038699 (Why is no real title available?)
- scientific article; zbMATH DE number 2080402 (Why is no real title available?)
- scientific article; zbMATH DE number 1759452 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 2114412 (Why is no real title available?)
- scientific article; zbMATH DE number 1408335 (Why is no real title available?)
- scientific article; zbMATH DE number 2241906 (Why is no real title available?)
- scientific article; zbMATH DE number 2241908 (Why is no real title available?)
- A comparison of pebble tree transducers with macro tree transducers
- A formal model for an expressive fragment of XSLT
- An algebraic approach to data languages and timed languages
- Attribute grammars for unranked trees as a query language for structured documents
- Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
- Automata, Languages and Programming
- Automata, Languages and Programming
- Automata, Languages and Programming
- CONCUR 2004 - Concurrency Theory
- Caterpillars, context, tree automata and tree pattern matching
- Computer Science Logic
- Conjunctive queries over trees
- Containment and equivalence for a fragment of XPath
- Database Programming Languages
- Database Theory - ICDT 2005
- Database Theory - ICDT 2005
- Deciding Equivalence of Finite Tree Automata
- Developments in Language Theory
- Expressiveness of structured document query languages based on attribute grammars
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Frontiers of tractability for typechecking simple XML transformations
- Fundamentals of Computation Theory
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Mathematical Foundations of Computer Science 2004
- Mathematical Foundations of Computer Science 2004
- Minimal Ascending and Descending Tree Automata
- Monadic Datalog and the expressive power of languages for web information extraction
- On the power of tree-walking automata.
- On two-way tree automata
- One-unambiguous regular languages
- Parallel and two-way automata on directed ordered acyclic graphs
- Query automata over finite trees
- Regular expression pattern matching for XML
- Rewriting Techniques and Applications
- STACS 2005
- THE ABSTRACT THEORY OF AUTOMATA
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
- The complexity of XPath query evaluation and XML typing
- The complexity of first-order and monadic second-order logic revisited
- Translations on a context free grammar
- Tree acceptors and some of their applications
- Tree transducers, L systems, and two-way machines
- Tree-walking automata do not recognize all regular languages
- Typechecking XML views of relational databases
- Typechecking for XML transformers
- Visibly pushdown languages
- XML queries and constraints, containment and reformulation
- XML with data values: Typechecking revisited.
- XPath and modal logics of finite DAG's
Cited in
(35)- The weighted HOM-problem over fields
- Leafy automata for higher-order concurrency
- Highly expressive query languages for unordered data trees
- XML compression via directed acyclic graphs
- Deterministic top-down tree automata: past, present, and future
- On-the-fly bisimilarity checking for fresh-register automata
- On characterization of fuzzy tree pushdown automata
- Parameterized complexity of basic decision problems for tree automata
- Operational state complexity of nested word automata
- One-variable context-free hedge automata
- State complexity of the concatenation of regular tree languages
- State complexity of Kleene-star operations on trees
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Synchronizing relations on words
- scientific article; zbMATH DE number 7561623 (Why is no real title available?)
- Active XML document rewriting based on tree automata theory
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- State trade-offs in unranked tree automata
- Tree Automata with Global Constraints
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Evolving schemas for streaming XML
- scientific article; zbMATH DE number 7649885 (Why is no real title available?)
- XML schema, tree logic and sheaves automata
- Foundations of XML processing. The tree-automata approach.
- Rewriting of visibly pushdown languages for XML data integration
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- Tree automata with global constraints
- Efficient inclusion checking for deterministic tree automata and XML schemas
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Reasoning about XML with temporal logics and automata
- Lower bounds for the size of deterministic unranked tree automata
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- Learning Tree Languages
- scientific article; zbMATH DE number 7561600 (Why is no real title available?)
- Regular expressions for data words
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)
