Deterministic pushdown automata can compress some normal sequences
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929464181522432 |
|---|---|
| author | Carton, Olivier Perifel, Sylvain |
| author_facet | Carton, Olivier Perifel, Sylvain |
| contents | In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_00734 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Deterministic pushdown automata can compress some normal sequences Carton, Olivier Perifel, Sylvain Formal Languages and Automata Theory In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author. |
| title | Deterministic pushdown automata can compress some normal sequences |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2205.00734 |