| Research>>> Acta Cybernetica>>> Previous Volumes>>> | Magyarul |
Syntactic Monoids of Codes
H. Jürgensen3
Abstract
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.
Footnotes:
1 This research has been supported by the Natural Sciences and Engineering Research Council of Canada, Grant OGP0000243. An earlier version of this paper was presented at the Second International Colloquium on Words, Languages, and Combinatorics, Kyoto, 25-28 August, 1992 []. A summary of the results of the present paper is presented in Chapter 8 of [].
2 This research has been supported by the Natural Sciences and Engineering Research Council of Canada, Grant OGP0000243. An earlier version of this paper was presented at the Second International Colloquium on Words, Languages, and Combinatorics, Kyoto, 25-28 August, 1992 []. A summary of the results of the present paper is presented in Chapter 8 of [].
3 Dartment of Computer Science, The University of Western Ontario London, Ontario, Canada N6A 5B7 and Institut für Informatik Universität Potsdam Am Neuen Palais 10 D-14469 Potsdam, Germany, e-mail: helmut@uwo.ca.