Sequentiality of Group-weighted Tree Automata
Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/Gutachten › Beitrag in Konferenzband › Beigetragen › Begutachtung
Beitragende
Abstract
We introduce the notion of group-weighted tree automata over commutative groups and characterise sequentialisability of such automata. In particular, we introduce a fitting notion for tree distance and prove the equivalence between sequentialisability, the so-called Lipschitz property, and the so-called twinning property.
Details
| Originalsprache | Englisch |
|---|---|
| Titel | Language and Automata Theory and Applications |
| Herausgeber (Verlag) | Springer, Berlin [u. a.] |
| Seiten | 267-278 |
| Seitenumfang | 12 |
| ISBN (elektronisch) | 978-3-030-68195-1 |
| ISBN (Print) | 978-3-030-68194-4 |
| Publikationsstatus | Veröffentlicht - 2021 |
| Peer-Review-Status | Ja |
Publikationsreihe
| Reihe | Lecture Notes in Computer Science, Volume 12368 |
|---|---|
| ISSN | 0302-9743 |
Externe IDs
| Scopus | 85104406727 |
|---|
Schlagworte
Schlagwörter
- approximated determinization, approximation, twinning property, weighted tree automata, approximated determinization, approximation