SOME CLASSIFICATIONS OF CONTEXT-FREE LANGUAGES

被引：31

作者：

GRUSKA, J

机构：

[1] Mathematical Institute, Slovak Academy of Sciences, Bratislava

来源：

INFORMATION AND CONTROL | 1969年 / 14卷 / 02期

关键词：

D O I：

10.1016/S0019-9958(69)90055-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

[No abstract available]

引用

页码：152 / &

共 12 条

[1]

CULIK K, TO BE PUBLISHED

[2]

CULIK K, 1962, SYMBOLIC LANGUAGES D, P75

[3] SOME RECURSIVELY UNSOLVABLE PROBLEMS IN ALGOL-LIKE LANGUAGES [J].

GINSBURG, S ;

ROSE, GF .

[4] OPERATIONS WHICH PRESERVE DEFINABILITY IN LANGUAGES [J].

GINSBURG, S ;

ROSE, GF .

[5]

GINSBURG S, 1966, MATHEMATICAL THEORY

[6]

Gruska J., 1967, KYBERNETIKA, V3, P22

[7] ON COMPUTATIONAL COMPLEXITY OF ALGORITHMS [J].

HARTMANIS, J ;

STEARNS, RE .

[8]

HARTMANIS J, 1965, P INT FED INFORM PRO, P31

KASAMI, T .

INFORMATION AND CONTROL, 1967, 10 (02) :209-+

[10]

KOPRIVA J, 1964, PUBL FAC SCI U JE PU, P409