In this paper, we give a Nivat-like characterization for weighted alternatingautomata over commutative semirings (WAFA) We prove that weighted alternating can be characterized as the concatenation of weightedfinite tree automata and a specific class of tree homomorphism . We show that the class of series recognized by weighted alternating automata is closed under inverses of homomorphisms, but not under homorphisms . Using the corresponding result for polynomial automata, we are able to prove that the ZERONESS problem for weightedalternating automata with the rational numbers as weights isdecidable .

Author(s) : Gustav Grabolle

Links : PDF - Abstract

Code :
Coursera

Keywords : automata - weighted - alternating - semirings - tree -

Leave a Reply

Your email address will not be published. Required fields are marked *