Deterministic pushdown automata can compress some normal sequences.
Olivier CartonSylvain PerifelPublished in: CoRR (2022)
Keyphrases
- finite state automaton
- turing machine
- hidden markov models
- cellular automata
- finite state
- finite automata
- model checking
- data compression
- long sequences
- biological sequences
- sequence matching
- sequential patterns
- black box
- variable length
- databases
- test sequences
- intrusion detection
- relaxation algorithm
- probabilistic automata
- data mining