Which XML schemas are streaming bounded repairable?

DOI10.1007/s00224-015-9611-yzbMath1352.68078OpenAlexW2085216072MaRDI QIDQ269345

Pierre Bourhis, Gabriele Puppis, Cristian Riveros

Publication date: 18 April 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9611-y

zbMATH Keywords

bounded repairDTDstreaming repairtop-down deterministic tree automatonXML schema

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded repairability of word languages
• A survey on tree edit distance and related problems
• A relation between edit distance for ordered trees and edit distance for Euler strings
• Streaming tree automata
• Automata, logics, and infinite games. A guide to current research
• The Cost of Traveling between Languages
• Adding nesting structure to words
• The Tree-to-Tree Correction Problem
• The String-to-String Correction Problem
• Bounded Repairability for Regular Tree Languages
• Fundamentals of Computation Theory
• One-unambiguous regular languages