Rewriting of visibly pushdown languages for XML data integration

DOI10.1016/j.tcs.2011.05.047zbMath1225.68084OpenAlexW1990424408MaRDI QIDQ719268

D. Kharzeev

Publication date: 10 October 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.047

zbMATH Keywords

XMLdata integrationvisibly pushdown languages

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Data structures (68P05)

Related Items (4)

Verification of opacity and diagnosability for pushdown systems ⋮ Colored nested words ⋮ A methodology for measuring structure similarity of fuzzy XML documents ⋮ Evolving schemas for streaming XML

Uses Software

• XPath
• Relax NG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewriting of regular expressions and regular path queries
• Automata for XML -- a survey
• Representation theorems on regular languages
• Marrying Words and Trees
• Visibly pushdown languages

This page was built for publication: Rewriting of visibly pushdown languages for XML data integration