Regular expressions for languages over infinite alphabets (extended abstract)

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

Volumn 3106, Issue , 2004, Pages 171-178

  Kaminski, Michael ^a   Tan, Tony ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PATTERN MATCHING;

EXTENDED ABSTRACTS; FINITE STATE; MODEL OF COMPUTATION; REGULAR EXPRESSIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 35048840349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27798-9_20     Document Type: Article

References (8)

1. M. Bielecki, J. Hidders, J. Paredaens, J. Tyszkiewicz, and J. Van den Bussch. Navigating with a browser. In P. Widmayer, F. Triguero, R. Morales, M. Hennessyd, S. Eidenbenz, and R. Conejo, editors, Proceedings of the 29th International Colloquium on Automata, Languages and Programming - ICALP 2002, pages 764-775, Berlin, 2002. Springer. Lecture Notes in Computer Science 2380.
2. B. Bolling, M. Leucker, and T. Noll. Generalized regular MSA languages. Technical report, Department of Computer Science, Aachen University of Technology, 2002.
3. M. Kaminski and N. Francez. Finite-memory automata. In Proceedings of the 31th Annual IEEE Symposium on Foundations of Computer Science, pages 683-688, Los Alamitis, CA, 1990. IEEE Computer Society Press.
4. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science A, 138:329-363, 1994.
5. H.R. Lewis and C.H. Papadimitriou. Elements of the theory of computation. Prentice-Hall, Inc., Englewood Cliffs, NJ, USA, 1981.
6. F. Neven, T. Schwentik, and V. Vianu. Towards regular languages over infinite alphabets. In J. Sgall, A. Pultr, and P. Kolman, editors, Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, pages 560-572, Berlin, 2001. Springer. Lecture Notes in Computer Science 2136.
7. Y. Shemesh and N. Francez. Finite-state unification automata and relational languages. Information and Computation, 114:192-213, 1994.
8. A. Tal. Decidability of inclusion for unification based automata. M.Sc. thesis, Department of Computer Science, Technion - Israel Institute of Technology, 1999.