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: | Jürgensen Helmut |
---|---|
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 |
Similar Items
-
Varieties of tree languages definable by syntactic monoids
by: Salehi Saeed
Published: (2005) -
On DR tree automata, unary algebras and syntactic path monoids
by: Steinby Magnus
Published: (2017) -
Methods for relativizing properties of codes
by: Jürgensen Helmut, et al.
Published: (2015) -
Schützenberger's monoids
by: Kim K. H., et al.
Published: (1979) -
On nonpermutational transformation semigroups with an application to syntactic complexity
by: Iván Szabolcs, et al.
Published: (2016)