A Nivat theorem for weighted alternating automata over commutative semirings

DOI10.4204/EPTCS.346.16MaRDI QIDQ6649528zbMATH OpenFDO

Authors

Publication date 6 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.346.16

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
• Alternating weighted automata over commutative semirings
• A Nivat theorem for quantitative automata on unranked trees
• Alternating Weighted Automata
• Weighted tree automata and weighted logics

Cites work

• A Nivat theorem for quantitative automata on unranked trees
• Alternating automata on infinite trees
• Alternating Weighted Automata
• Alternating weighted automata over commutative semirings
• Alternation
• Computer science today. Recent trends and developments
• Handbook of weighted automata
• Max and sum semantics for alternating weighted automata
• On equations for regular languages, finite automata, and sequential networks
• On the definition of a family of automata
• Quantitative Languages
• Transductions des langages de Chomsky
• Weighted automata
• Weighted automata and logics on graphs
• Weighted automata and weighted logics
• Weighted automata and weighted logics
• Weighted logics for unranked tree automata
• Weighted tree automata and tree transducers
• Weighted tree automata and weighted logics

Cited in

(1)

• A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings

This page was built for publication: A Nivat theorem for weighted alternating automata over commutative semirings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649528)