A Nivat theorem for weighted alternating automata over commutative semirings
From MaRDI portal
Publication:6649528
DOI10.4204/eptcs.346.16MaRDI QIDQ6649528
Publication date: 6 December 2024
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Cites Work
- On equations for regular languages, finite automata, and sequential networks
- Handbook of weighted automata
- Weighted tree automata and weighted logics
- Alternating automata on infinite trees
- Transductions des langages de Chomsky
- Alternating weighted automata over commutative semirings
- Computer science today. Recent trends and developments
- Weighted automata
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Weighted Automata and Logics on Graphs
- Max and Sum Semantics for Alternating Weighted Automata
- Alternating Weighted Automata
- On the definition of a family of automata
- Quantitative Languages
- Alternation
- Weighted Automata and Weighted Logics
- Weighted Tree Automata and Tree Transducers
- A Nivat Theorem for Quantitative Automata on Unranked Trees
This page was built for publication: A Nivat theorem for weighted alternating automata over commutative semirings
