| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata
Abstract : We study the problem of whether regular expressions for nested words can be compiled to small deterministic nested word au-tomata (NWAs). In theory, we obtain a positive answer for small deter-ministic regular expressions for nested words. In practice of navigational path queries, nondeterministic NWAs are obtained for which NWA de-terminization explodes. We show that practical good solutions can be obtained by using stepwise hedge automata as intermediates.
Cited literature [29 references]
https://hal.inria.fr/hal-02532706
Contributor : Inria Links <>
Submitted on : Sunday, July 19, 2020 - 3:12:19 PM
Last modification on : Friday, December 11, 2020 - 6:44:06 PM
Contributor : Inria Links <>
Submitted on : Sunday, July 19, 2020 - 3:12:19 PM
Last modification on : Friday, December 11, 2020 - 6:44:06 PM
File
0-short.pdf
Files produced by the author(s)