Compact Representation for Answer Sets of n-ary Regular Queries

DOI10.1007/978-3-642-02979-0_13zbMath1248.68303OpenAlexW2262464304MaRDI QIDQ3637346

Kazuhiro Inaba, Haruo Hosoya

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Regular expression pattern matching for XML
• Expressiveness of structured document query languages based on attribute grammars
• Query evaluation via tree-decompositions
• Monadic datalog and the expressive power of languages for Web information extraction
• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: Compact Representation for Answer Sets of n-ary Regular Queries