Mutually Accepting Capacitated Automata

Ravid Alon*, Orna Kupferman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We study capacitated automata (CAs)[10], where transitions correspond to resources and have capacities, bounding the number of times they may be traversed. We follow the utilization semantics of CAs and view them as recognizers 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 can be mutually accepted by A: the multiset of runs on all the words in S together respects the bounds induced by the capacities. Thus, capacitated automata model possible utilizations of systems with bounded resources. We study the basic properties of CAs: their expressive power in the nondeterministic and deterministic models, closure under classical operations, and the complexity of basic decision problems.

Original languageAmerican English
Title of host publicationDescriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings
EditorsGalina Jirásková, Giovanni Pighizzini
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages12
ISBN (Print)9783030625351
StatePublished - 2020
Event22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020 - Vienna, Austria
Duration: 24 Aug 202026 Aug 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12442 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.


Dive into the research topics of 'Mutually Accepting Capacitated Automata'. Together they form a unique fingerprint.

Cite this