A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove that the behavior of a weighted alternating au...
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado: |
Logical Methods in Computer Science e.V.
2023-12-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Acceso en liña: | https://lmcs.episciences.org/9215/pdf |