Determinization of Min-Plus Weighted Automata is Decidable
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908291799449600 |
|---|---|
| author | Almagor, Shaull Arbel, Guy Sheinvald, Sarai |
| author_facet | Almagor, Shaull Arbel, Guy Sheinvald, Sarai |
| contents | We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of nondeterministic automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23826 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Determinization of Min-Plus Weighted Automata is Decidable Almagor, Shaull Arbel, Guy Sheinvald, Sarai Formal Languages and Automata Theory Logic in Computer Science We show that the determinization problem for min-plus (tropical) weighted automata is decidable, thus resolving this long-standing open problem. In doing so, we develop a new toolbox for analyzing and reasoning about the run-structure of nondeterministic automata. |
| title | Determinization of Min-Plus Weighted Automata is Decidable |
| topic | Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2503.23826 |