XML schema, tree logic and sheaves automata

DOI10.1007/s00200-006-0016-7zbMath1107.68048OpenAlexW2008958263MaRDI QIDQ862561

Denis Lugiez, Silvano Dal Zilio

Publication date: 24 January 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-006-0016-7

zbMATH Keywords

XMLXML schemaTree automataModal logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items (4)

Complexity of modal logics with Presburger constraints ⋮ Tree Automata for Non-linear Arithmetic ⋮ FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER ⋮ Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

Cites Work

• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• Query automata over finite trees
• Multitree automata that count
• Tree automata help one to solve equational formulae in AC-theories
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• A logic you can count on
• Anytime, anywhere
• Regular expression pattern matching for XML
• Automata, Languages and Programming
• Définition et etude des Bilangages réguliers
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: XML schema, tree logic and sheaves automata