On Repetitive Finite Automata with Translucent Words
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912493567213568 |
|---|---|
| author | Mráz, František Otto, Friedrich |
| author_facet | Mráz, František Otto, Friedrich |
| contents | We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting or rejecting, but it may change into another state and continue with its computation. We establish that a repetitive DFAwtw already accepts a language that is not even semi-linear, which shows that the property of being repetitive increases the expressive capacity of the DFAwtw and the NFAwtw considerably. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_15315 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Repetitive Finite Automata with Translucent Words Mráz, František Otto, Friedrich Formal Languages and Automata Theory F.1.1; F.4.3 We introduce and study the repetitive variants of the deterministic and the nondeterministic finite automaton with translucent words (DFAwtw and NFAwtw). On seeing the right sentinel, a repetitive NFAwtw need not halt immediately, accepting or rejecting, but it may change into another state and continue with its computation. We establish that a repetitive DFAwtw already accepts a language that is not even semi-linear, which shows that the property of being repetitive increases the expressive capacity of the DFAwtw and the NFAwtw considerably. |
| title | On Repetitive Finite Automata with Translucent Words |
| topic | Formal Languages and Automata Theory F.1.1; F.4.3 |
| url | https://arxiv.org/abs/2507.15315 |