Збережено в:
| Автори: | , |
|---|---|
| Формат: | Preprint |
| Опубліковано: |
2023
|
| Предмети: | |
| Онлайн доступ: | https://arxiv.org/abs/2309.08321 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| _version_ | 1866909787270152192 |
|---|---|
| author | Rystsov, Igor Szykuła, Marek |
| author_facet | Rystsov, Igor Szykuła, Marek |
| contents | Motivated by the Černý conjecture for automata, we introduce the concept of monoidal automata, which allows the formulation of the Černý conjecture for monoids. We show upper bounds on the reset threshold of monoids with certain properties. In particular, we obtain a quadratic upper bound if the transformation monoid contains a primitive group of permutations and a singular of maximal rank with only one point of contraction. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_08321 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Reset thresholds of transformation monoids Rystsov, Igor Szykuła, Marek Formal Languages and Automata Theory Motivated by the Černý conjecture for automata, we introduce the concept of monoidal automata, which allows the formulation of the Černý conjecture for monoids. We show upper bounds on the reset threshold of monoids with certain properties. In particular, we obtain a quadratic upper bound if the transformation monoid contains a primitive group of permutations and a singular of maximal rank with only one point of contraction. |
| title | Reset thresholds of transformation monoids |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2309.08321 |