Efficient inclusion checking for deterministic tree automata and XML schemas
type: Item
instance of: scholarly article
title: Efficient inclusion checking for deterministic tree automata and XML schemas
zbMATH Open document ID: 1191.68377
author: Jérôme Champavère
author: Rémi Gilleron
author: Aurélien Lemay
author: Joachim Niehren
published in: Information and Computation
publication date: 2009-11-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5639683
zbMATH Keywords: tree automata
zbMATH Keywords: language inclusion
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: XML shemas
describes a project that uses: Ltur
describes a project that uses: Datalog LITE
MaRDI profile type: Publication
full work available at URL: j.ic.2009.03.003
OpenAlex ID: W2090802466
cites work: Deciding Equivalence of Finite Tree Automata
cites work: Haskell overloading is DEXPTIME-complete
cites work: Automata for XML -- a survey
cites work: Typechecking for XML transformers
cites work: Schema-Guided Induction of Monadic Queries
cites work: Rewriting Techniques and Applications
cites work: One-unambiguous regular languages
cites work: On the minimization of XML schemas and tree automata for unranked trees
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: Database Theory - ICDT 2005
cites work: Q3146939
cites work: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
cites work: Mathematical Foundations of Computer Science 2004
cites work: Datalog LITE
cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
cites work: Regular expressions into finite automata
cites work: Q3902489
cites work: Streaming tree automata
cites work: Marrying Words and Trees
DOI: 10.1016/J.IC.2009.03.003
Recommended article: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Recommended article: Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
Recommended article: Q5314437
Recommended article: On the minimization of XML schemas and tree automata for unranked trees
Recommended article: Certifying a Tree Automata Completion Checker
Recommended article: Alternating automata on data trees and XPath satisfiability
Recommended article: Q3058276
Recommended article: Q4447237
description: scientific article; zbMATH DE number 5639683