MUTUALLY ACCEPTING CAPACITATED AUTOMATA

We study capacitated automata (CAs) [10], where transitions orrespond to re-soures and have apaities, bounding the number of times they may be traversed. We follow the utilization semantics of CAs and view them as reognizers of multi-languages – sets of multisets of words, where a multiset S of words is in the multi-language of a CA A if all the words in S an be mutually aepted by A: the multiset of runs on all the words in S together respets the bounds indued by the apai-ties. Thus, apaitated automata model possible utilizations of systems with bounded resoures. We study the basi properties of CAs: their expressive power in the non-deterministi and deterministi models, losure under lassial operations, and the omplexity of basi deision problems.