Weighted variable automata over infinite alphabets

DOI10.1007/978-3-319-08846-4_23MaRDI QIDQ3192274zbMATH OpenOpenAlexFDO

Authors Maria Pittou, George Rahonis

Publication date 26 September 2014

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08846-4_23

zbMATH Keywords

semiringsinfinite alphabetsweighted variable automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Weighted recognizability over infinite alphabets
• Weighted Automata and Weighted Logics on Infinite Words
• Weighted automata and weighted logics on infinite words
• ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
• Variable automata over infinite alphabets

Cited in

(7)

• Weighted recognizability over infinite alphabets
• Newton series, coinductively
• Alternating weighted automata over commutative semirings
• Variable tree automata over infinite ranked alphabets
• Theory Is Forever
• The validity of weighted automata
• Variable automata over infinite alphabets

This page was built for publication: Weighted variable automata over infinite alphabets

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