SEMIRETRACTS OF A FREE MONOID

被引：5

作者：

ANDERSON, JA

机构：

[1] Division of Mathematics and Computer Science, University of South Carolina, Spartanburg

来源：

THEORETICAL COMPUTER SCIENCE | 1994年 / 134卷 / 01期

关键词：

D O I：

10.1016/0304-3975(94)90274-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The generating set of a semiretract of a free monoid is an infix code and a biprefix code. If a free monoid is generated by n elements then any nest of semiretracts contains at most n + 1 distinct members.

引用

页码：3 / 11

页数：9

共 8 条

[1]

ANDERSON J, IN PRESS INT J COMPU

[2]

BERSTEL J, 1985, THEORY CODES

[3] THE POSET OF RETRACTS OF A FREE MONOID [J].

FORYS, W ;

HEAD, T .

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 37 (1-2) :45-48

[4] RETRACTS OF FREE MONOIDS ARE NOWHERE DENSE WITH RESPECT TO FINITE-GROUP TOPOLOGIES AND P-ADIC TOPOLOGIES [J].

FORYS, W ;

HEAD, T .

SEMIGROUP FORUM, 1991, 42 (01) :117-119

[5] EXPANDED SUBALPHABETS IN THE THEORIES OF LANGUAGES AND SEMIGROUPS [J].

HEAD, T .

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1982, 12 (02) :113-123

[6]

LALLEMENT G, 1979, SEMIGROUPS COMBINATO

[7] ON THE STRUCTURE OF SOME GROUP CODES [J].

LONG, DY .

SEMIGROUP FORUM, 1992, 45 (01) :38-44

[8]

Salomaa A., 1981, JEWELS FORMAL LANGUA

← 1 →