Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata

DOI10.1007/978-3-030-50026-9_12OpenAlexW3015696132MaRDI QIDQ5042238

Iovka Boneva, Momar Sakho, Joachim Niehren

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-50026-9_12

zbMATH Keywords

automataregular expressionsnested words\textsc{XPath}

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• XDuce
• XPath

Cites Work

• On the minimization of XML schemas and tree automata for unranked trees
• Efficient inclusion checking for deterministic tree automata and XML schemas
• Propositional dynamic logic of regular programs
• Regular expressions into finite automata
• Early nested word automata for XPath query answering on XML streams
• Visibly rational expressions
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Earliest Query Answering for Deterministic Nested Word Automata
• Marrying Words and Trees
• Visibly pushdown languages
• A Formal Framework for Complex Event Processing
• Streamable Fragments of Forward XPath
• Automata, Languages and Programming
• Rewriting Techniques and Applications
• One-unambiguous regular languages

This page was built for publication: Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata