Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata

Iovka Boneva
Joachim Niehren
Momar Sakho
  • Function : Author
  • PersonId : 1019942

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.
Fichier principal
Vignette du fichier
0-short.pdf (3.09 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02532706 , version 1 (05-04-2020)
hal-02532706 , version 2 (19-07-2020)

Identifiers

  • HAL Id : hal-02532706 , version 2

Cite

Iovka Boneva, Joachim Niehren, Momar Sakho. Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata. CSR 2020 - 15th International Computer Science Symposium in Russia, Jun 2020, Ekaterinburg, Russia. ⟨hal-02532706v2⟩
99 View
188 Download

Share

Gmail Facebook X LinkedIn More