Window size two suffices for deterministic monotone RWW-automata.
Frantisek MrázFriedrich OttoPublished in: NCMA (2019)
Keyphrases
- window size
- finite state automaton
- sliding window
- turing machine
- window sizes
- cellular automata
- fixed size
- finite state machines
- congestion control
- order statistics
- upper bound
- black box
- finite automata
- probabilistic automata
- regular expressions
- deterministic finite automata
- data streams
- uniform distribution
- data sets
- boolean functions
- state space
- optical flow