DECOMPOSITIONS OF SEMI-THUE-SYSTEMS

被引：2

作者：

CLAUS, V

WALTER, H

机构：

[1] Institut für Angewandte Mathematik der Universität des Saarlandes, Saarbrücken

来源：

COMPUTING | 1969年 / 4卷 / 02期

关键词：

D O I：

10.1007/BF02234759

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider five notions of decompositions of Semi-Thue-Systems. These are interesting in view of the theory of Semi-Thue-Systems as well as in regard to practical applications (simplification of the analysisproblem). The decompositions form a simple hierarchy. We proof a necessary and sufficient condition for each of the decompositions. Three of the notions are shown to be determinable in general, the other two notions are determinable only for contextfree Semi-Thue-Systems. © 1969 Springer-Verlag.

引用

页码：107 / &

共 12 条

[1]

BAUER FL, 1967, 4 COLL AUT MUNCH ED

[2]

Chomsky N., 1959, INFORM CONTROL, V2, P137, DOI 10.1016/S0019-9958(59)90362-6

[3]

Ehresmann Ch., 1965, CATEGORIES STRUCTURE

[4]

GINSBURG S, 1966, MATHEMATICAL THEORY

[5]

HOTZ G, 1967, 4 COLL AUT MUNCH

[6]

HOTZ G, 1966, EIK, V2, P235

[7]

KURODA SY, 1964, INFORM CONTR, V7, P202

[8] 3 THEOREMS ON PHRASE STRUCTURE GRAMMARS OF TYPE 1 [J].

LANDWEBER, PS .

INFORMATION AND CONTROL, 1963, 6 (02) :131-&

[9] 4 PROBLEMS OF DECIBABILITY IN CONTEXT-SENSITIVE LANGUAGES [J].

SCHNORR, CP .

COMPUTING, 1968, 3 (04) :311-&

[10]

VOLLMERHAUS W, 1967, BEITRAGE LINGUISTIK, V12

← 1 2 →