Visibly Pushdown Transducers for Approximate Validation of Streaming XML

DOI10.1007/978-3-540-77684-0_16zbMath1138.68435OpenAlexW1512553031MaRDI QIDQ5445303

No author found.

Publication date: 4 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of data (68P01)

Related Items (5)

Visibly pushdown transducers ⋮ Evolving schemas for streaming XML ⋮ Visibly rational expressions ⋮ Minimization of Visibly Pushdown Automata Using Partial Max-SAT ⋮ Approximate XML structure validation based on document-grammar tree similarity

Cites Work

• Bounded regular path queries in view-based data integration
• Regular path queries under approximate semantics
• Visibly pushdown languages
• A Minimum Distance Error-Correcting Parser for Context-Free Languages
• Automata, Languages and Programming
• Foundations of Information and Knowledge Systems

This page was built for publication: Visibly Pushdown Transducers for Approximate Validation of Streaming XML