Automata for XML -- a survey
type: Item
instance of: scholarly article
title: Automata for XML -- a survey
zbMATH Open document ID: 1115.68101
author: Thomas Schwentick
published in: Journal of Computer and System Sciences
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5146906
zbMATH Keywords: semistructured data
zbMATH Keywords: XML
zbMATH Keywords: automata
describes a project that uses: PathLog
describes a project that uses: XPath
MaRDI profile type: Publication
full work available at URL: j.jcss.2006.10.003
OpenAlex ID: W2092398161
cites work: Translations on a context free grammar
cites work: Typechecking XML views of relational databases
cites work: XML with data values: Typechecking revisited.
cites work: Visibly pushdown languages
cites work: STACS 2005
cites work: Q4826114
cites work: A formal model for an expressive fragment of XSLT
cites work: CONCUR 2004 - Concurrency Theory
cites work: Automata, Languages and Programming
cites work: Tree-walking automata do not recognize all regular languages
cites work: An algebraic approach to data languages and timed languages
cites work: One-unambiguous regular languages
cites work: Caterpillars, context, tree automata and tree pattern matching
cites work: THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
cites work: Q5714249
cites work: Rewriting Techniques and Applications
cites work: Developments in Language Theory
cites work: Fundamentals of Computation Theory
cites work: Q4447237
cites work: XML queries and constraints, containment and reformulation
cites work: Tree acceptors and some of their applications
cites work: Mathematical Foundations of Computer Science 2004
cites work: Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4941149
cites work: Q4269133
cites work: A comparison of pebble tree transducers with macro tree transducers
cites work: Macro Tree Translations of Linear Size Increase are MSO Definable
cites work: Tree transducers, L systems, and two-way machines
cites work: The complexity of first-order and monadic second-order logic revisited
cites work: Q4210160
cites work: Q4179852
cites work: THE ABSTRACT THEORY OF AUTOMATA
cites work: The complexity of XPath query evaluation and XML typing
cites work: Monadic datalog and the expressive power of languages for Web information extraction
cites work: Conjunctive queries over trees
cites work: Q4414534
cites work: Computer Science Logic
cites work: Regular expression pattern matching for XML
cites work: Q4153609
cites work: Finite-memory automata
cites work: Q2778879
cites work: Q4415261
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4473157
cites work: Q4414526
cites work: Frontiers of tractability for typechecking simple XML transformations
cites work: Database Theory - ICDT 2005
cites work: Database Programming Languages
cites work: Automated Reasoning with Analytic Tableaux and Related Methods
cites work: Containment and equivalence for a fragment of XPath
cites work: Typechecking for XML transformers
cites work: On two-way tree automata
cites work: Attribute grammars for unranked trees as a query language for structured documents
cites work: Query automata over finite trees
cites work: Q4411812
cites work: Expressiveness of structured document query languages based on attribute grammars
cites work: On the power of tree-walking automata.
cites work: Q4414544

Automata for XML -- a survey (cites work)
cites work: Finite state machines for strings over infinite alphabets

Automata for XML -- a survey (cites work)
cites work: Minimal Ascending and Descending Tree Automata

Automata for XML -- a survey (cites work)
cites work: Q4536402

Automata for XML -- a survey (cites work)
cites work: Deciding Equivalence of Finite Tree Automata

Automata for XML -- a survey (cites work)
cites work: Automata, Languages and Programming

Automata for XML -- a survey (cites work)
cites work: Q5714247

Automata for XML -- a survey (cites work)
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic

Automata for XML -- a survey (cites work)
cites work: Q4714446

Automata for XML -- a survey (cites work)
cites work: Parallel and two-way automata on directed ordered acyclic graphs

Automata for XML -- a survey (cites work)
cites work: Q4449164

Automata for XML -- a survey (cites work)
cites work: Q4414543

Automata for XML -- a survey (DOI)
DOI: 10.1016/J.JCSS.2006.10.003