Kutrib, MartinMartinKutribMalcher, AndreasAndreasMalcherWendlandt, MatthiasMatthiasWendlandt2022-09-122014-09-032022-09-122014http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-110573https://jlupub.ub.uni-giessen.de/handle/jlupub/7531http://dx.doi.org/10.22029/jlupub-6965We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether or not an element is in the set. We investigate the computational power of deterministic set automata and compare the language class accepted with the context-free languages and classes of languages accepted by queue automata. As results the incomparability to all classes considered is obtained. In the second part of the paper, we examine the closure properties of the class of DSA languages under Boolean operations. Finally, we show that deterministic set automata may be an interesting model from a practical point of view by proving that their emptiness problem is decidable.enIn Copyrightset automataclosure propertiesemptiness problemdecidabilityddc:004