Context-free languages over infinite alphabets

Acta Informatica

Volumn 35, Issue 3, 1998, Pages 245-267

  Cheng, Edward Y C ^a   Kaminski, Michael ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032369790     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050120     Document Type: Article

References (8)

1. J.-M. Autebert, J. Beauquir, L. Boasson: Langages des alphabets infinis, Discrete Applied Mathematics 2 (1980), 1-20.
2. J.-M. Autebert, J. Beauquir, L. Boasson: Formes de langages et de grammaries, Acta Informatica 17 (1982), 193-213.
3. J.E. Hopcroft, J.D. Ullman: Introduction to automata theory, languages, and computation, Addison Wesley, Reading, MA, 1979.
4. J. ltd: Automates a pile sur des alphabets infinis, Proceedings of the Symposium of Theoretical Aspects of Computer Science, Springer-Verlag, Berlin, 1984, pp . 260-273 (Lecture Notes in Computer Science 166).
5. M. Kaminski, N. Francez: Finite-memory automata, Theoretical Computer Science A 138 (1994), 329-363.
6. H.R. Lewis, C.H. Papadimitriou: Elements of the theory of computation, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1981.
7. F. Otto: Classes of regular and context-free languages over countably infinite alphabets, Discrete Applied Mathematics 12 (1985), 41-56.
8. Y. Shemesh, N. Francez: Finite-state unification automata and relational languages, Information and Computation 114 (1994), 192-213.