An algebraic characterization of deterministic regular languages over infinite alphabets

Theoretical Computer Science

Volumn 306, Issue 1-3, 2003, Pages 155-175

  Francez, Nissim ^a   Kaminski, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; THEOREM PROVING; WEBSITES;

FINITE-MEMORY AUTOMATA;

FINITE AUTOMATA;

EID: 0041507100     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00246-9     Document Type: Article

References (15)

1. Autebert J.-M., Beauquir J., Boasson L. Langages des alphabets infinis. Discrete Appl. Math. 2:1980;1-20.
2. Autebert J.-M., Beauquir J., Boasson L. Formes de langages et de grammaries. Acta Inform. 17:1982;193-213.
3. M. Bielecki, J. Hidders, J. Paredaens, J. Tyszkiewicz, J. Van den Bussch, Navigating with a browser, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proc. 29th Internat. Colloq. on Automata, Languages and Programming - ICALP 2002, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 764-775.
4. B. Bolling, M. Leucker, t. Noll, Generalized regular MSA languages, Technical Report, Department of Computer Science, Aachen University of Technology, 2002.
5. Cheng E.Y.C., Kaminski M. Context-free languages over infinite alphabets. Acta Inform. 35:1998;245-267.
6. Ginzburg A. Algebraic Theory of Automata. 1968;Academic Press, New York, NY.
7. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages, and Computation. 1979;Addison-Wesley, Reading, MA.
8. J. Itd, Automates a pile sur des alphabets infinis, in: Proc. Symp. of Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 166, Springer, Berlin, 1984, pp. 260-273.
9. M. Kaminski, N. Francez, Finite-memory automata, in: Proc. 31th Annu. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitis, CA, 1990, pp. 683-688.
10. Kaminski M., Francez N. Finite-memory automata. Theoret. Comput. Sci. A. 138:1994;329-363.
11. Neven F., Schwentik T., Vianu V. Towards regular languages over infinite alphabets. Sgall J., P. Kolman A. Pultr, Proc. 26th Internat. Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 2136:2001;560-572 Springer, Berlin.
12. Otto F. Classes of regular and context-free languages over countably infinite alphabets. Discrete Appl. Math. 12:1985;41-56.
13. Rabin M.O., Scott D. Finite automata and their decision problems. IBM J. Res. Develop. 3:1959;114-125.
14. Sakamoto H., Ikeda D. Intractability of decision problems for finite-memory automata. Theoret. Comp. Sci. A. 231:2000;297-308.
15. Shemesh Y., Francez N. Finite-state unification automata and relational languages. Inform. and Comput. 114:1994;192-213.