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 条
  • [21] Parameterized Regular Expressions and Their Languages
    Barcelo, Pablo
    Libkin, Leonid
    Reutter, Juan L.
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 351 - 362
  • [22] Enumerating regular expressions and their languages
    Lee, J
    Shallit, J
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2005, 3317 : 2 - 22
  • [23] Parameterized regular expressions and their languages
    Barcelo, Pablo
    Reutter, Juan
    Libkin, Leonid
    THEORETICAL COMPUTER SCIENCE, 2013, 474 : 21 - 45
  • [24] Regular binoid expressions and regular binoid languages
    Hashiguchi, K
    Wada, Y
    Jimbo, S
    THEORETICAL COMPUTER SCIENCE, 2003, 304 (1-3) : 291 - 313
  • [25] Counting Multiplicity over Infinite Alphabets
    Manuel, Amaldev
    Ramanujam, R.
    REACHABILITY PROBLEMS, PROCEEDINGS, 2009, 5797 : 141 - 153
  • [26] Tree automata over infinite alphabets
    Kaminski, Michael
    Tan, Tony
    PILLARS OF COMPUTER SCIENCE, 2008, 4800 : 386 - 423
  • [27] Variable Automata over Infinite Alphabets
    Grumberg, Orna
    Kupferman, Orna
    Sheinvald, Sarai
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 561 - +
  • [28] LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES
    Chaturvedi, Namit
    Olschewski, Joerg
    Thomas, Wolfgang
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (05) : 985 - 1000
  • [29] Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data
    Numaya, Yutaro
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    INTERNATIONAL CONFERENCE ON GRAMMATICAL INFERENCE, VOL 217, 2023, 217 : 23 - 34
  • [30] On monotone languages and their characterization by regular expressions
    Gyurica, Gyoergy
    ACTA CYBERNETICA, 2007, 18 (01): : 117 - 134
12345