Which XML schemas are streaming bounded repairable?
From MaRDI portal
(Redirected from Publication:269345)
Recommendations
Cites work
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A relation between edit distance for ordered trees and edit distance for Euler strings
- A survey on tree edit distance and related problems
- Adding nesting structure to words
- Automata, logics, and infinite games. A guide to current research
- Bounded repairability for regular tree languages
- Bounded repairability of word languages
- Deterministic top-down tree automata: past, present, and future
- Fundamentals of Computation Theory
- One-unambiguous regular languages
- Streaming tree automata
- The Cost of Traveling between Languages
- The String-to-String Correction Problem
- The Tree-to-Tree Correction Problem
Cited in
(5)
This page was built for publication: Which XML schemas are streaming bounded repairable?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269345)