The power of non-deterministic reassignment in infinite-alphabet pushdown automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5533 LNCS, Issue , 2009, Pages 107-127

  Dubov, Yulia ^a   Kaminski, Michael ^b  

^a INTEL CORPORATION   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PUSH-DOWN AUTOMATA;

LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 70350679195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01748-3_8     Document Type: Conference Paper

References (11)

1. 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)
2. Bray, T., Paoli, J., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) 1.0. W3C Recommendation (1998), http://www.w3.org/TR/REC-xml
3. Cheng, E., Kaminski, M.: Context-free languages over infinite alphabets. Acta Informatica 35, 245-267 (1998)
4. David, C.: Mots et données infinies. Master's thesis, Université Paris 7, LIAFA (2004)
5. Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Transactions on Computational logic 10 (2009) (to appear)
6. 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)
7. Kaminski, M., Francez, N.: Finite-memory automata. Theoretical Computer Science 138, 329-363 (1994)
8. 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)
9. Kaminski, M., Zeitlin, D.: Extending finite-memory automata with non-deterministic 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)
10. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5, 403-435 (2004)
11. Shemesh, Y., Francez, N.: Finite-state unification automata and relational languages. Information and Computation 114, 192-213 (1994)