EXTENDING REGULAR EXPRESSIONS WITH ITERATED SHUFFLE

被引：32
作者：
JANTZEN, M
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1985年 / 38卷 / 2-3期
关键词：
D O I：
10.1016/0304-3975(85)90221-X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：223 / 247
页数：25
相关论文
共 26 条
[1]   FLOW LANGUAGES EQUAL RECURSIVELY-ENUMERABLE LANGUAGES [J].
ARAKI, T ;
TOKURA, N .
ACTA INFORMATICA, 1981, 15 (03) :209-217
[2]   RELATIONS OF FLOW LANGUAGES TO PETRI NET LANGUAGES [J].
ARAKI, T ;
KAGIMASA, T ;
TOKURA, N .
THEORETICAL COMPUTER SCIENCE, 1981, 15 (01) :51-75
[3]  
BERSTEL J, 1979, TRANSDUCTIONS CONTEX
[4]   PARALLEL SYSTEM SCHEMAS AND THEIR RELATION TO AUTOMATA [J].
CZAJA, L .
INFORMATION PROCESSING LETTERS, 1980, 10 (03) :153-158
[5]   RATIONAL SETS IN COMMUTATIVE MONOIDS [J].
EILENBERG, S ;
SCHUTZENBERGER, MP .
JOURNAL OF ALGEBRA, 1969, 13 (02) :173-+
[6]  
Ginsburg S, 1975, ALGEBRAIC AUTOMATA T
[7]  
GISHER J, 1981, COMM ACM, V24, P597
[8]  
Greibach S. A., 1978, Theoretical Computer Science, V7, P311, DOI 10.1016/0304-3975(78)90020-8
[9]  
HACK M, 1975, MIT124 COMP STRUCT G
[10]   VERY SPECIAL LANGUAGES AND REPRESENTATIONS OF RECURSIVELY-ENUMERABLE LANGUAGES VIA COMPUTATION HISTORIES [J].
HAUSSLER, D ;
ZEIGER, HP .
INFORMATION AND CONTROL, 1980, 47 (03) :201-212
123