Sequentiality of Group-weighted Tree Automata
Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
Contributors
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
| Original language | English |
|---|---|
| Title of host publication | Language and Automata Theory and Applications |
| Publisher | Springer, Berlin [u. a.] |
| Pages | 267-278 |
| Number of pages | 12 |
| ISBN (electronic) | 978-3-030-68195-1 |
| ISBN (print) | 978-3-030-68194-4 |
| Publication status | Published - 2021 |
| Peer-reviewed | Yes |
Publication series
| Series | Lecture Notes in Computer Science, Volume 12368 |
|---|---|
| ISSN | 0302-9743 |
External IDs
| Scopus | 85104406727 |
|---|
Keywords
Keywords
- approximated determinization, approximation, twinning property, weighted tree automata, approximated determinization, approximation