Weighted recognizability over infinite alphabets

DOI10.14232/ACTACYB.23.1.2017.16MaRDI QIDQ5350158zbMATH OpenOpenAlexFDO

Authors Maria Pittou, George Rahonis

Publication date 25 August 2017

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.1.2017.16

zbMATH Keywords

infinite alphabetssemiringsweighted LDLweighted MSOweighted variable automata

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(4)

• Variable tree automata over infinite ranked alphabets
• Weighted variable automata over infinite alphabets
• Variable automata over infinite alphabets
• Theory Is Forever

This page was built for publication: Weighted recognizability over infinite alphabets

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