Syntactic monoids of codes
A general characterization theorem for syntactic monoids of codes that satisfy independence conditions of a special form is proved. This result provides insight in some known characterizations of classes of codes via syntactic monoids and provides a general mechanism for deriving new characterizatio...
Saved in:
Main Author: | |
---|---|
Format: | Article |
Published: |
1999
|
Series: | Acta cybernetica
14 No. 1 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Subjects: | |
Online Access: | http://acta.bibl.u-szeged.hu/12614 |
Summary: | A general characterization theorem for syntactic monoids of codes that satisfy independence conditions of a special form is proved. This result provides insight in some known characterizations of classes of codes via syntactic monoids and provides a general mechanism for deriving new characterizations for other classes of languages. |
---|---|
Physical Description: | 117-133 |
ISSN: | 0324-721X |