This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.,Perrin,D., Perrot,J.F. and A. Restivo, Sur le théorème du défaut, J. of Algebra, (1979), in press.
De Luca,A., On some properties of the syntactic semigroup of a very pure subsemigroup, RAIRO,I.T. (1979), in press.
De Luca,A., A note on "very pure" subsemigroups of a free semigroup, in "Non commutative structures in Algebra and Geometric Combinatorics".Proceedings of the Conference held at Laboratorio di Cibernetica del CNR,Arco Felice,Napoli,July 1978 (to appear).
De Luca,A., Perrin,D., Restivo,A. and S.Termini,Synchronization and simplification, Discrete Mathematics (1979), in press.
De Luca,A. and A.Restivo, On some properties of very pure codes, Theoretical Computer Science, (1979), in press.
Eilenberg,S., Automata,Languages and Machines,Academic Press,New York, vol.A (1974), vol. B (1976).
Hashiguchi, K. and N. Honda, Properties of code events and homomorphisms over regular events, J. Comput. System Sci. 12 (1976), 352–367.
Levenstein, V. I., On some properties of encoding and on self-tuning automatons for the decoding of information, Problemy Kibernetiki 11 (1964), 63–121.
Perrin,D., Codes et combinatoire du monoide libre,Cours de DEA 1976–77, Université de Paris VII (1978).
Perrin,D. and M.P.Schützenberger, Un problème élémentaire de la théorie de l'Information. Colloques Internationaux du C.N.R.S. n. 276-Théorie de l'Information. Cachan, 4–8 juillet 1977, pp.249–260.
Pin J.,Une caractérisation de trois variétés de langages bien connues, 4-th G.I. Conference on Theoretical Computer Science, 26–28 Mars 1979, Aachen, Lecture Notes in Computer Science, Springer-Verlag.
Restivo, A.,On a question of McNaughton and Papert, Information and Control 25 (1974), 93–101.
Restivo, A.A combinatorial property of codes having finite synchronization delay, Theoretical Computer Science 1 (1975), 95–101.
Restivo, A.,On codes having no finite completions,Discrete Mathematics, 17 (1977), 309–316.
Schützenberger, M.P., On an application of semigroup methods to some problems in coding, IRE Trans. Information Theory, 2 (1956), 47–60.
Schützenberger,M.P., Codes à longueur variables, Cours à l'Ecole d'Eté de l'OTAN sur les méthodes combinatoires en théorie du codage, Royan, France (1965) unpublished.
Schützenberger, M.P.,On a factorization of free monoids,Proc. of AMS, 16 (1965), 21–24.
Schützenberger,M.P.,Sur une propriété combinatoire des algèbres de Lie libres pouvant etre utilisée dans un problème de mathématique appliquée,Séminaire Dubreil-Pisot (Algèbre et théorie des nombres), exposé n. 1, 1958/59,Paris.
Spehner, J.C., Sur les codes synchronisants, C.R. Acad.Sc. Paris, t. 281 (1975), Série A, 779–782.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Luca, A., Restivo, A. (1979). Synchronization and maximality for very pure subsemigroups of a free semigroup. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_34
Download citation
DOI: https://doi.org/10.1007/3-540-09526-8_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09526-2
Online ISBN: 978-3-540-35088-0
eBook Packages: Springer Book Archive