We initiate the study of verification power Affine finite automata (AfA) as a part Arthur-Merlin (AM) proof systems. show that every unary language is verified by real-valued AfA verifier. Then, we focus on verifiers restricted to have only integer-valued or rational-valued transitions. observe can be simulated verifiers, and their protocols in nondeterministic polynomial time. this upper bound...

Data automata on data words is a decidable model proposed by Bojańczyk et al. in 2006. Class automata, introduced recently by Bojańczyk and Lasota, is an extension of data automata which unifies different automata models on data words. The nonemptiness of class automata is undecidable, since class automata can simulate two-counter machines. In this paper, a decidable model called class automata...