Towards Regular Languages over Infinite Alphabets

Frank Neven, Thomas Schwentick, Victor Vianu. Towards Regular Languages over Infinite Alphabets. In Jiri Sgall, Ales Pultr, Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Volume 2136 of Lecture Notes in Computer Science, pages 560-572, Springer, 2001. [doi]

@inproceedings{NevenSV01,
  title = {Towards Regular Languages over Infinite Alphabets},
  author = {Frank Neven and Thomas Schwentick and Victor Vianu},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2136/21360560.htm},
  researchr = {https://researchr.org/publication/NevenSV01},
  cites = {0},
  citedby = {0},
  pages = {560-572},
  booktitle = {Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings},
  editor = {Jiri Sgall and Ales Pultr and Petr Kolman},
  volume = {2136},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42496-2},
}