On the Capacity of Capacitated Automata

3 years 11 days ago
On the Capacity of Capacitated Automata
Capacitated automata (CAs) have been recently introduced in [8] as a variant of finite-state automata in which each transition is associated with a (possibly infinite) capacity. The capacity bounds the number of times the transition may be traversed in a single run. The study in [8] includes preliminary results about the expressive power of CAs, their succinctness, and the complexity of basic decision problems for them. We continue the investigation of the theoretical properties of CAs and solve problems that have been left open in [8]. In particular, we show that union and intersection of CAs involve an exponential blow-up and that their determinization involves a doubly-exponential blow up. This blow-up is carried over to complementation and to the complexity of the universality and containment problems, which we show to be EXPSPACE-complete. On the positive side, capacities do not increase the complexity when used in the deterministic setting. Also, the containment problem for non...
Orna Kupferman, Sarai Sheinvald
Added 07 Apr 2016
Updated 07 Apr 2016
Type Journal
Year 2016
Where LATA
Authors Orna Kupferman, Sarai Sheinvald
Comments (0)