Finite-memory automata with non-deterministic reassignment

International Journal of Foundations of Computer Science

Volumn 21, Issue 5, 2010, Pages 741-760

  Kaminski, Michael ^a   Zeitlin, Daniel ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Round Tower   (Israel)

Author keywords

finite memory automata; Infinite alphabets; regular expressions

Indexed keywords

EID: 77957770065     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054110007532     Document Type: Conference Paper

References (12)

1. E. Y. C. Cheng and M. Kaminski, "Context-free languages over infinite alphabets", Acta Informatica 35 (1998) 245-267.
2. Y. Dubov and M. Kaminski, "The power of non-deterministic reassignment in infinitealphabet pushdown automata", in Languages: from Formal to Natural. Essays dedicated to Nissim Francez on his 65th Birthday, eds. O. Grumberg, M. Kaminski, S. Katz and S. Wintner (Springer, Berlin, 2009), volume 5533 of Lecture Notes in Computer Science, pp. 107-127.
3. M. Kaminski and N. Francez, "Finite-memory automata", in Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Press, los Alamitos, CA, 1990), pp. 683-688.
4. M. Kaminski and N. Francez, "Finite-memory automata", Theoretical Computer Science 134 (1994) 329-363.
5. M. Kaminski and T. Tan, "Regular expressions for languages over infinite alphabets", in Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, eds. K.-Y. Chwa and J. I. Munro (Springer, Berlin, 2004), volume 3106 of Lecture Notes in Computer Science, pp. 171-178.
6. M. Kaminski and T. Tan, "Regular expressions for languages over infinite alphabets", Fundamenta Informaticae 69 (2006) 301-318.
7. M. Kaminski and T. Tan, "Tree automata over infinite alphabets", in Pillars of Computer Science - Essays Dedicated to Boris (Boaz) Trakhtenbrot, eds. A. Avron, N. Dershowitz and A. Rabinovich (Springer, Berlin, 2008), volume 4800 of Lecture Notes in Computer Science, pp. 386-423.
8. F. Neven, T. Schwentick and V. Vianu, "Towards regular languages over infinite alphabets", in Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001, eds. J. Sgall, A. Pultr and P. Kolman (Springer, Berlin, 2001), volume 2136 of Lecture Notes in Computer Science, pp. 560-572.
9. F. Neven, T. Schwentick and V. Vianu, "Finite state machines for strings over infinite alphabets", ACM Transactions on Computational Logic 5 (2004) 403-435.
10. Y. Shemesh and N. Francez, "Finite-state unification automata and relational languages", Information and Computation 114 (1994) 192-213.
11. A. Tal, "Decidability of inclusion for unification based automata", Master's thesis, Department of Computer Science, Technion - Israel Institute of Technology, 1999.
12. D. Zeitlin, "Look-ahead finite-memory automata", Master's thesis, Department of Computer Science, Technion - Israel Institute of Technology, 2006.