SYNCHRONIZATION AND SIMPLIFICATION

被引：12

作者：

DELUCA, A

PERRIN, D

RESTIVO, A

TERMINI, S

机构：

[1] Laboratorio di Cibernetica, CNR, Arco Felice, Napoli

[2] Laboratoire Informatique Theorique et Programmation, LA 248, Université de Rouen

来源：

DISCRETE MATHEMATICS | 1979年 / 27卷 / 03期

关键词：

D O I：

10.1016/0012-365X(79)90164-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We describe the notions of synchronization and simplification with respect to a given subsemigroup P of a semigroup S in terms of the syntactic semigroup of P. These notions derive from coding theory, which corresponds to the case where P is a free subsemigroup of a free semigroup; we apply the results to give a unified account of several theorems previously published. © 1979.

引用

页码：297 / 308

页数：12

共 20 条

[1]

BOE JM, 1976, THESIS MONTPELLIER

[2]

Clifford A.H., 1961, AM MATH SOC, V7

[3]

CLIFFORD AH, 1967, AM MATH SOC, V2

[4]

DELUCA A, IN PRESS

[5]

EILENBERG S, 1976, AUTOMATA LANGUAGES M, VB

[6]

Eilenberg S., 1974, AUTOMATA LANGUAGES M, VA

[7] VARIABLE-LENGTH BINARY ENCODINGS [J].

GILBERT, EN ;

MOORE, EF .

BELL SYSTEM TECHNICAL JOURNAL, 1959, 38 (04) :933-967

[8] CODES WITH BOUNDED SYNCHRONIZATION DELAY [J].

GOLOMB, SW ;

GORDON, B .

INFORMATION AND CONTROL, 1965, 8 (04) :355-&

[9]

GUIBAS L, UNPUBLISHED

[10]

McNaughton Robert, 1971, COUNTER FREE AUTOMAT

← 1 2 →