Ravid Alon, Orna Kupferman*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageAmerican English
Pages (from-to)5-25
Number of pages21
JournalJournal of Automata, Languages and Combinatorics
Issue number1-3
StatePublished - 2023

Bibliographical note

Funding Information:
Work partially supported by the Israel Science Foundation, ISF grant agreement no 2357/19. Orna Kupferman: 0000-0003-4699-6117

Publisher Copyright:
© Institut für Informatik · Justus-Liebig-Universität Giessen.


  • automata
  • deision problems
  • expressive power
  • multi-languages


Dive into the research topics of 'MUTUALLY ACCEPTING CAPACITATED AUTOMATA'. Together they form a unique fingerprint.

Cite this