Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917195197448192 |
|---|---|
| author | Bell, Jason P. Smertnig, Daniel |
| author_facet | Bell, Jason P. Smertnig, Daniel |
| contents | The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one. Furthermore, the linear hull can also be used to determine whether the minimal automaton is equivalent to an unambiguous one. We show how to compute the linear hull, and thus prove that it is decidable whether or not a given automaton over a number field is equivalent to a deterministic one. In this case we are also able to compute an equivalent deterministic automaton. We also show the analogous decidability and computability result for the unambiguous case. Our results resolve a problem posed in a 2006 survey by Lombardy and Sakarovitch. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_02260 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields Bell, Jason P. Smertnig, Daniel Formal Languages and Automata Theory Combinatorics The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one. Furthermore, the linear hull can also be used to determine whether the minimal automaton is equivalent to an unambiguous one. We show how to compute the linear hull, and thus prove that it is decidable whether or not a given automaton over a number field is equivalent to a deterministic one. In this case we are also able to compute an equivalent deterministic automaton. We also show the analogous decidability and computability result for the unambiguous case. Our results resolve a problem posed in a 2006 survey by Lombardy and Sakarovitch. |
| title | Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields |
| topic | Formal Languages and Automata Theory Combinatorics |
| url | https://arxiv.org/abs/2209.02260 |