RECURRENT WORDS AND SIMULTANEOUS GROWTH IN T0L SYSTEMS

被引：1

作者：

LANGE, KJ ^{[1
]}

WELZL, E ^{[1
]}

机构：

[1] GRAZ TECH UNIV,INST INFORMAT VERARBEITUNG,A-8010 GRAZ,AUSTRIA

来源：

关键词：

D O I：

10.1016/0304-3975(85)90002-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 15

页数：15

共 9 条

[1] A NOTE ON RECURRENT WORDS [J].

CULIK, K ;

WOOD, D .

INFORMATION AND CONTROL, 1981, 51 (01) :88-93

[2]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[3]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[4] COMPLEXITY OF SOME PROBLEMS CONCERNING L-SYSTEMS [J].

JONES, ND ;

SKYUM, S .

MATHEMATICAL SYSTEMS THEORY, 1979, 13 (01) :29-43

[5] LIFE AND DEATH IN MARKOV DETERMINISTIC TABLED OL SYSTEMS [J].

JURGENSEN, H ;

MATTHEWS, D ;

WOOD, D .

INFORMATION AND CONTROL, 1981, 48 (01) :80-93

[6] INTERCALATION LEMMAS FOR TREE TRANSDUCER LANGUAGES [J].

PERRAULT, CR .

[7]

Rozenberg Grzegorz, 1980, MATH THEORY L SYSTEM

[8]

SALOMAA A, 1978, AUTOMATA THEORETIC A

[9]

Van Leeuwen J., 1975, Information Processing Letters, V3, P138, DOI 10.1016/0020-0190(75)90027-7