We study capacitated automata (CAs), where transitions correspond to resources and may have
bounded capacities. Each transition in a CA is associated with a (possibly infinite) bound on
the number of times it may be traversed. We study CAs from two points of view. The first
is that of traditional automata theory, where we view CAs as recognizers of formal languages
and examine their expressive power, succinctness, and determinization. The second is that of
resource-allocation theory, where we view CAs as a rich description of a flow network and study
their utilization.