Abstract
We 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 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cherubini, A., Citrini, C., Crespi-Reghizzi, S., Mandrioli, D.: QRT FIFO automata, breadth-first grammars and their relations. Theoret. Comput. Sci. 85, 171–203 (1991)
Chomsky, N.: On certain formal properties of grammars. Inform. Control 2, 137–167 (1959)
Daley, M., Eramian, M.G., McQuillan, I.: The bag automaton: A model of nondeterministic storage. J. Autom., Lang. Comb. 13, 185–206 (2008)
Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389–418 (1967)
Holzer, M., Kutrib, M.: Flip-pushdown automata: k + 1 pushdown reversals are better than k. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 490–501. Springer, Heidelberg (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
Kutrib, M., Malcher, A., Mereghetti, C., Palano, B., Wendlandt, M.: Input-driven queue automata: Finite turns, decidability, and closure properties. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 232–243. Springer, Heidelberg (2013)
Lange, K.-J., Reinhardt, K.: Automaten mit der Datenstruktur Menge. In: Kutrib, M., Worsch, T. (eds.) 5. Theorietag Automaten und Formale Sprachen, pp. 159–167. Universität Giessen, Giessen (1995)
Ogden, W.F.: Intercalation theorems for stack languages. In: Proceedings of the First Annual ACM Symposium on Theory of Computing (STOC 1969), pp. 31–42. ACM Press, New York (1969)
Sénizergues, G.: L(A) = L(B)? decidability results from complete formal systems. Theoret. Comput. Sci. 251, 1–166 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Kutrib, M., Malcher, A., Wendlandt, M. (2014). Deterministic Set Automata. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-09698-8_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09697-1
Online ISBN: 978-3-319-09698-8
eBook Packages: Computer ScienceComputer Science (R0)