A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

DOI10.46298/lmcs-19(4:27)2023arXiv2203.07370OpenAlexW4390232466MaRDI QIDQ6137852

Unnamed Author

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.07370

zbMATH Keywords

automata theorytree automataweighted automataalternating automataweighted logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

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
• 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
• Sequences of Level 1, 2, 3,..., k,...
• Quantitative Languages
• Alternation
• Weighted Automata and Weighted Logics
• Weighted Tree Automata and Tree Transducers
• A Nivat Theorem for Quantitative Automata on Unranked Trees
• Regular Functions and Cost Register Automata

This page was built for publication: A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings