scientific article; zbMATH DE number 7056225
From MaRDI portal
Publication:5376652
zbMath1421.68094arXiv1707.00527MaRDI QIDQ5376652
Pierre-Alain Reynier, Olivier Gauwin, Frédéric Servais, Emmanuel Filiot
Publication date: 17 May 2019
Full work available at URL: https://arxiv.org/abs/1707.00527
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the memory requirements of XPath evaluation over XML streams
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Systems of word equations, polynomials and linear algebra: a new approach
- Sliding window algorithms for regular languages
- Visibly pushdown transducers
- Determinization of transducers over finite and infinite words.
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Economy of description for single-valued transducers
- Trimming visibly pushdown automata
- Tight lower bounds for query processing on streaming and external memory data
- Validating XML documents in the streaming model with external memory
- Query Automata for Nested Words
- Earliest Query Answering for Deterministic Nested Word Automata
- Adding nesting structure to words
- MSO definable string transductions and two-way finite-state transducers
- Streaming Property Testing of Visibly Pushdown Languages *
- Two-Way Visibly Pushdown Automata and Transducers
- From Two-Way to One-Way Finite State Transducers
- Regularity Problems for Visibly Pushdown Languages
- Efficient and Expressive Tree Filters
- A regularity test for pushdown machines
- Model checking of safety properties
This page was built for publication:
