Abstract
In this paper we compare two models of pushdown automata over infinite alphabets, one with non-deterministic reassignment and the other with the deterministic one, and show that the former model is stronger than the latter.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 7–16. IEEE Computer Society, Los Alamitos (2006)
Bray, T., Paoli, J., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) 1.0. W3C Recommendation (1998), http://www.w3.org/TR/REC-xml
Cheng, E., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245–267 (1998)
David, C.: Mots et données infinies. Master’s thesis, Université Paris 7, LIAFA (2004)
Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational logic 10 (2009) (to appear)
Dubov, Y.: Infinite alphabet pushdown automata: various approaches and comparison of their consequences. Master’s thesis, Department of Computer Science, Technion – Israel Institute of Technology (2008)
Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 138, 329–363 (1994)
Kaminski, M., Tan, T.: Tree automata over infinite alphabets. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 386–423. Springer, Heidelberg (2008)
Kaminski, M., Zeitlin, D.: Extending finite-memory automata with non-determinis- tic reassignment. In: Csuhaj-Varjú, E., Ézik, Z. (eds.) Proceedings of the 12th International Conference on Automata and Formal Languages – AFL 2008, Computer and Automation Research Institute, Hungarian Academy of Science, pp. 195–207 (2008)
Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5, 403–435 (2004)
Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Information and Computation 114, 192–213 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dubov, Y., Kaminski, M. (2009). The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata. In: Grumberg, O., Kaminski, M., Katz, S., Wintner, S. (eds) Languages: From Formal to Natural. Lecture Notes in Computer Science, vol 5533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01748-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-01748-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01747-6
Online ISBN: 978-3-642-01748-3
eBook Packages: Computer ScienceComputer Science (R0)