Regular expressions for languages over infinite alphabets

被引：0
|
作者：
Kaminski, M [1 ]
Tan, T
机构：
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[2] Natl Univ Singapore, Sch Comp, Singapore 117543, Singapore
来源：
COMPUTING AND COMBINATORICS, PROCEEDINGS | 2004年 / 3106卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is acceptable by finite-state unification based automaton - a model of computation that is tightly related to other models of automata over infinite alphabets.
引用
收藏
页码：171 / 178
页数：8
相关论文
共 50 条
  • [1] Regular expressions for languages over infinite alphabets
    Kaminski, M
    Tan, T
    FUNDAMENTA INFORMATICAE, 2006, 69 (03) : 301 - 318
  • [2] Towards regular languages over infinite alphabets
    Neven, R
    Schwentick, T
    Vianu, V
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 560 - 572
  • [3] An algebraic characterization of deterministic regular languages over infinite alphabets
    Francez, N
    Kaminski, M
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 155 - 175
  • [4] LANGUAGES OVER INFINITE ALPHABETS
    AUTEBERT, JM
    BEAUQUIER, J
    BOASSON, L
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 1 - 20
  • [5] P finite automata and regular languages over countably infinite alphabets
    Dassow, Juergen
    Vaszil, Gyorgy
    MEMBRANE COMPUTING, 2006, 4361 : 367 - +
  • [6] CLASSES OF REGULAR AND CONTEXT-FREE LANGUAGES OVER COUNTABLY INFINITE ALPHABETS
    OTTO, F
    DISCRETE APPLIED MATHEMATICS, 1985, 12 (01) : 41 - 56
  • [7] LEARNING REGULAR LANGUAGES OVER LARGE ORDERED ALPHABETS
    Mens, Irini-Eleftheria
    Maler, Oded
    LOGICAL METHODS IN COMPUTER SCIENCE, 2015, 11 (03)
  • [8] Context-free languages over infinite alphabets
    Edward Y.C. Cheng
    Michael Kaminski
    Acta Informatica, 1998, 35 : 245 - 267
  • [9] Context-free languages over infinite alphabets
    Cheng, EYC
    Kaminski, M
    ACTA INFORMATICA, 1998, 35 (03) : 245 - 267
  • [10] Closure Under Reversal of Languages over Infinite Alphabets
    Genkin, Daniel
    Kaminski, Michael
    Peterfreund, Liat
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 145 - 156
12345