Regular matching and inclusion on compressed tree patterns with context variables

DOI10.1007/978-3-030-13435-8_25MaRDI QIDQ2278289zbMATH OpenOpenAlexFDO

Authors Iovka Boneva, Joachim Niehren, Momar Sakho

Publication date 4 December 2019

Full work available at URL https://hal.inria.fr/hal-01811835v4/file/0-short.pdf

zbMATH Keywords

computational complexitytree automatatree languagestree patterns

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Regular matching and inclusion on compressed tree patterns with constrained context variables
• Tree pattern matching from regular tree expressions.
• Compressed membership problems for regular expressions and hierarchical automata
• Implementation and Application of Automata
• The complexity of tree automata and XPath on grammar-compressed trees

Cited in

(2)

• Certain query answering on compressed string patterns: from streams to hyperstreams
• Regular matching and inclusion on compressed tree patterns with constrained context variables

This page was built for publication: Regular matching and inclusion on compressed tree patterns with context variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278289)