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

DOI10.1007/978-3-030-50026-9_12MaRDI QIDQ5042238zbMATH OpenOpenAlexFDO

Authors Iovka Boneva, Joachim Niehren, Momar Sakho

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)

Cites work

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

Describes a project that uses

Uses Software

• XPath
• XDuce

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042238)