Weighted Tree Automata -- May it be a little more?
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_ | 1866918308563910656 |
|---|---|
| author | Fülöp, Zoltán Vogler, Heiko |
| author_facet | Fülöp, Zoltán Vogler, Heiko |
| contents | This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of Universal Algebra. It originated from two sources: weighted string automata and finite-state tree automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2212_05529 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Weighted Tree Automata -- May it be a little more? Fülöp, Zoltán Vogler, Heiko Formal Languages and Automata Theory This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of Universal Algebra. It originated from two sources: weighted string automata and finite-state tree automata. |
| title | Weighted Tree Automata -- May it be a little more? |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2212.05529 |