Deterministic pushdown automata can compress some normal sequences.

Olivier Carton Sylvain Perifel

Published in: Log. Methods Comput. Sci. (2024)

Keyphrases

finite state automaton
turing machine
variable length
data compression
long sequences
finite state
hidden markov models
cellular automata
sequential patterns
regular expressions
model checking
database
case study
search engine
finite automata
information retrieval
machine learning
randomized algorithms
databases