Simple splicing systems

被引：30

作者：

Mateescu, A

Paun, G

Rozenberg, G

Salomaa, A

机构：

[1] Romanian Acad, Inst Math, RO-70700 Bucharest, Romania

[2] Acad Finland, Dept Math, Turku, Finland

[3] Univ Turku, FI-20500 Turku, Finland

[4] Leiden Univ, Dept Comp Sci, NL-2300 RA Leiden, Netherlands

[5] Univ Colorado, Dept Comp Sci, Boulder, CO 80309 USA

来源：

DISCRETE APPLIED MATHEMATICS | 1998年 / 84卷 / 1-3期

基金：

芬兰科学院;

关键词：

D O I：

10.1016/S0166-218X(98)00002-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider one of the most restrictive classes of splicing (H) systems, namely based on splicing rules of the form (a,lambda; a,lambda), where a is a symbol in a given set and lambda is the empty string. They correspond to a special class of "null context splicing systems", as introduced in Head (1987). A series of language-theoretic properties of languages generated by such systems with finite sets of axioms are investigated. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：145 / 163

页数：19

共 23 条

[1]

BUCHER W, 1991, THEORET COMPUT SCI, V14, P227

[2]

CARAUSU A, 1981, REV ROUM MATH PURE A, V26, P713

[3] SPLICING SEMIGROUPS OF DOMINOES AND DNA [J].