Nested Regular Expressions can be Compiled ...

Document type :
Communication dans un congrès avec actes
Title :
Nested Regular Expressions can be Compiled to Small Deterministic Nested Word Automata
Author(s) :
Boneva, Iovka [Auteur] refId
Linking Dynamic Data [LINKS]
Niehren, Joachim [Auteur] refId
Linking Dynamic Data [LINKS]
Sakho, Momar [Auteur]
Linking Dynamic Data [LINKS]
Conference title :
CSR 2020 - 15th International Computer Science Symposium in Russia
City :
Ekaterinburg
Country :
Russie
Start date of the conference :
2020-06-29
HAL domain(s) :
Informatique [cs]/Logique en informatique [cs.LO]
English abstract : [en]
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 ...
Show more >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Harvested from HAL
Files
Thumbnail
Thumbnail
Thumbnail