scientific article; zbMATH DE number 7802071

zbMath1530.68153arXiv2209.10312MaRDI QIDQ6191006

Joachim Niehren, Unnamed Author, Momar Sakho

Publication date: 8 February 2024

Full work available at URL: https://arxiv.org/abs/2209.10312

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Streaming tree automata
• Early nested word automata for XPath query answering on XML streams
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Earliest Query Answering for Deterministic Nested Word Automata
• Weak Second‐Order Arithmetic and Finite Automata
• Adding nesting structure to words
• Visibly pushdown languages
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Rewriting Techniques and Applications

This page was built for publication: