Regular languages in the sliding window model
From MaRDI portal
Cites work
- Adding nesting structure to words
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Approximate counting: a detailed analysis
- Approximate formulas for some functions of prime numbers
- Approximate Hamming distance in a stream
- Automata theory on sliding windows
- Automata vs. Logics on Data Words
- Chrobak normal form revisited, with applications
- Communication and Streaming Complexity of Approximate Pattern Matching
- Communication Complexity
- Communication complexity (for algorithm designers)
- Complement on prefix-free, suffix-free, and non-returning NFA languages
- Computing diameter in the streaming and sliding-window models
- Counting large numbers of events in small registers
- Data streams. Models and algorithms.
- Derandomization for sliding window algorithms with strict correctness
- Dictionary matching in a stream
- Distributed streams algorithms for sliding windows
- Dynamic algorithms for the Dyck languages
- Dynamic word problems
- Efficient Summing over Sliding Windows
- Exact and Approximate Pattern Matching in the Streaming Model
- Finite semigroup varieties of the form V*D
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Give me some slack: efficient network measurements
- Handbook of weighted automata
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1947403 (Why is no real title available?)
- scientific article; zbMATH DE number 2119720 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- scientific article; zbMATH DE number 7651106 (Why is no real title available?)
- scientific article; zbMATH DE number 7650239 (Why is no real title available?)
- Hyper-minimisation Made Efficient
- Low-latency sliding window algorithms for formal languages
- Maintaining Stream Statistics over Sliding Windows
- Maintaining time-decaying stream aggregates
- Nearly optimal distinct elements and heavy hitters on sliding windows
- On randomized one-round communication complexity
- Optimal sampling from sliding windows
- Periodicity in data streams with wildcards
- Periodicity in streams
- Probabilistic automata
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Property testing and its connection to learning and approximation
- Quasi-Periodicity in Streams
- Querying regular languages over sliding windows
- Randomized sliding window algorithms for regular languages
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet
- Real-time streaming string-matching
- Recognizing well-parenthesized expressions in the streaming model
- Regular functions and cost register automata (invited paper)
- Regular languages are testable with a constant number of queries
- Searching Long Repeats in Streams
- Searching runs in streams
- Sliding windows over context-free languages
- Small-space and streaming pattern matching with k edits
- Streaming \(k\)-mismatch with error correcting and applications
- Streaming algorithms for language recognition problems
- Streaming algorithms for recognizing nearly well-parenthesized expressions
- Streaming dictionary matching with mismatches
- Streaming Pattern Matching with d Wildcards
- Streaming periodicity with mismatches
- Streaming Property Testing of Visibly Pushdown Languages *
- Testing and spot-checking of data streams
- The \(k\)-mismatch problem revisited
- The space complexity of approximating the frequency moments
- The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
- The streaming \(k\)-mismatch problem
- Tight tradeoffs for real-time approximation of longest palindromes in streams
- Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
- Validating XML documents in the streaming model with external memory
- Visibly pushdown languages over sliding windows
This page was built for publication: Regular languages in the sliding window model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987458)
