INTERCALATION LEMMAS FOR TREE TRANSDUCER LANGUAGES

被引：7

作者：

PERRAULT, CR ^{[1
]}

机构：

[1] UNIV TORONTO,DEPT COMP SCI,TORONTO M5S 1A7,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1016/S0022-0000(76)80040-2

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：246 / 277

页数：32

共 19 条

[1]

[Anonymous], 1970, Mathematical Systems Theory, DOI DOI 10.1007/BF01695769

[2]

[Anonymous], MATHEMATICAL THEORY

[3]

[Anonymous], 1970, Journal of Computer and System Sciences, DOI DOI 10.1016/S0022-0000(70)80017-4

[4]

BAKER BS, 1973, THESIS HARVARD U

[5]

Bar-Hillel Yehoshua, 1961, Zeitschrift fir Phonetik, Sprachwissenschaft und Kommunikationsforschung, V14, P143

[6]

Buchi J.R., 1964, Arch. fur mathematische Logik Grundlagenforschung, V6, P91, DOI DOI 10.1007/BF01969548

[7] DESIGN OF A SEPARABLE TRANSITION-DIAGRAM COMPILER [J].

CONWAY, ME .

[8] BOTTOM-UP AND TOP-DOWN TREE TRANSFORMATIONS - COMPARISON [J].

ENGELFRIET, J .

MATHEMATICAL SYSTEMS THEORY, 1975, 9 (03) :198-231

[9]

GORN S, 1965, P C SYSTEMS COMPUTER

[10]

Hardy G., 1952, INEQUALITIES