Preview
Unable to display preview. Download preview PDF.
Bibliographie
J. BRZOZOWSKI et I. SIMON. Characterizations of locally testable events, Discrete Math. 4 (1973) 243–271.
S. EILENBERG. Automata, Languages and Machines, Ac. Press. Vol A (1974) Vol B (1976.)
S.W. GOLOMB et B. GORDON. Codes with bounded synchronization delay. Information and Control 8-p 355–372 (1965).
K. Hashiguchi et N. Honda: Properties of Code events and homomorphisms over regular events, J. Comp. Syst. Sci. 12 (1976) p. 352–367.
R. Mc NAUGHTON. Algebraic Decision Procedures for Local Testability. Math. Syst. Theory Vol 8 No 1.
J-F. PERROT. Informatique et Algèbre: la théorie des codes à longueur variable. Proceedings of the 3rd GI Conference, Lecture Notes in Computer Science No48, Springer (1977) p 27–44.
J-F. PERROT. On the theory of syntactic monoids for rational languages, dans: Fundamentals of Computation Theory, Lecture Notes in Computer Science No56 Springer (1977) 152–165.
J-F. PERROT. Variétés de langages et opérations. Theoretical Computer Science 7 (1978) 198–210.
J.E. PIN. Sur le monoïde syntactique de L* lorsque L est un langage fini. Theoretical Computer Science 7 (1978) p 211–215.
A. RESTIVO. Codes and aperiodic languages in 1. Fachtagung über Automatentheorie und formalle Sprachen, Lecture Notes in Computer Science No2, Springer (1973) p 175–181.
A. RESTIVO. On a question of Mc Naughton and Papert. Information and Control Vol 25, No1 mai 1974 p 93–101.
M.P. SCHÜTZENBERGER. Sur certaines pseudovariétés de monoïdes finis. IRIA-Laboria. Rapport de Recherche No62, 1974.
M.P. SCHÜTZENBERGER. On finite monoids having only trivial subgroups. Information and Control 8 (1965) 190–194.
M.P. SCHÜTZENBERGER. Sur certaines opérations de fermeture dans les langages rationnels. Istituto Nazionale di Alta Mathematica. Symposia Mathematica Vol XV (1975).
M.P. SCHÜTZENBERGER. Sur le produit de concaténation non ambigü. Semigroup Forum I 3, p 47–75 (1975)
M.P. SCHÜTZENBERGER. On an application of semigroup methods to some problems in coding, I.R.E. Trans. on Information theory, I.T.2, (1956) 47–60
I. SIMON. Piece wise testable events. 2nd GI Conference Lecture Notes in Computer Science, Springer Verlag (1976) p 214–222
Y. ZALCSTEIN. Locally testable languages, J. Comput System Sci 6 (1972), 151–167.
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pin, J.E. (1979). Une caracterisation de trois varietes de langages bien connues. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_25
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive