@inproceedings{21cff80dd4a3488685221cc77d793476,
title = "Properties and utilization of capacitated automata",
abstract = "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.",
keywords = "Automata, Capacitated transitions, Determinization, Maximum utilization",
author = "Orna Kupferman and Tami Tamir",
year = "2014",
month = dec,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.FSTTCS.2014.33",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "33--44",
editor = "Venkatesh Raman and Suresh, {S. P.}",
booktitle = "34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014",
address = "ألمانيا",
note = "34th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2014 ; Conference date: 15-12-2014 Through 17-12-2014",
}