scientific article; zbMATH DE number 7559138

DOI10.4230/LIPIcs.STACS.2019.29MaRDI QIDQ5090478

Moses Ganardi

Publication date: 18 July 2022

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

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

zbMATH Keywords

sliding windowsvisibly pushdown languagesrational transductions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Subsequences in bounded ranges: matching and analysis problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streaming algorithms for language recognition problems
• Optimal sampling from sliding windows
• Economy of description for single-valued transducers
• Dictionary Matching in a Stream
• Visibly pushdown languages
• Minimization of Rational Word Functions
• The k-mismatch problem revisited
• Approximate Hamming Distance in a Stream
• Streaming Property Testing of Visibly Pushdown Languages *
• Querying Regular Languages over Sliding Windows
• Maintaining Stream Statistics over Sliding Windows
• Real-Time Streaming String-Matching
• Recognizing Well-Parenthesized Expressions in the Streaming Model
• Regular canonical systems
• Regularity Problems for Visibly Pushdown Languages
• Bounded Algol-Like Languages
• On Context-Free Languages
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: