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 条
  • [31] Regular expressions -: Languages, algorithms, and software
    Kernighan, BW
    Pike, R
    DR DOBBS JOURNAL, 1999, 24 (04): : 19 - 22
  • [32] On Nilpotent Languages and Their Characterization by Regular Expressions
    Gyurica, Gyoergy
    ACTA CYBERNETICA, 2009, 19 (01): : 231 - 244
  • [33] General Idempotency Languages Over Small Alphabets
    Leupold, Peter
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (03) : 343 - 357
  • [34] Morphisms on infinite alphabets, countable states automata and regular sequences
    Zhang, Jie-Meng
    Chen, Jin
    Guo, Ying-Jun
    Wen, Zhi-Xiong
    CHAOS SOLITONS & FRACTALS, 2017, 99 : 263 - 269
  • [35] Random Regular Expression Over Huge Alphabets
    Nicaud, Cyril
    Rotondo, Pablo
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2021, 32 (05) : 419 - 438
  • [36] Weighted Variable Automata over Infinite Alphabets
    Pittou, Maria
    Rahonis, George
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014, 2014, 8587 : 304 - 317
  • [37] Ultragraphs and shift spaces over infinite alphabets
    Goncalves, Daniel
    Royer, Danilo
    BULLETIN DES SCIENCES MATHEMATIQUES, 2017, 141 (01): : 25 - 45
  • [38] Performance of universal codes over infinite alphabets
    Orlitsky, A
    Santhanam, NP
    DCC 2003: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2003, : 402 - 410
  • [39] On the closure of pattern expressions languages under intersection with regular languages
    Cezar Câmpeanu
    Nicolae Santean
    Acta Informatica, 2009, 46 : 193 - 207
  • [40] On the closure of pattern expressions languages under intersection with regular languages
    Campeanu, Cezar
    Santean, Nicolae
    ACTA INFORMATICA, 2009, 46 (03) : 193 - 207
12345