Determinization and Minimization of Automata for Nested Words Revisited

Determinization and Minimization of Automata for Nested Words Revisited

We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant=&qu...

Full description

Bibliographic Details
Main Authors: Joachim Niehren, Momar Sakho
Format: Article
Language:English
Published: MDPI AG 2021-02-01
Series:Algorithms
Subjects:
regular expressions
tree automata
nested words
hedges
logical queries
XPath
Online Access:https://www.mdpi.com/1999-4893/14/3/68

Internet

https://www.mdpi.com/1999-4893/14/3/68

Similar Items