EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 15 / No 2 (1981) RAIRO. Inform. théor., 15 2 (1981) 149-159 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 15, Number 2, 1981
Page(s) 149 - 159
DOI https://doi.org/10.1051/ita/1981150201491
Published online 01 February 2017
  1. 1. S. EILENBERG, Automata, Languages and Machines, Vol. B., Academic Press, New York, 1976. [MR: 530383] [Zbl: 0359.94067] [Google Scholar]
  2. 2. J. F. PERROT, On the Theory of Syntactic Monoids for Rational Languages, in Fundamentals of Computation Theory, Lecture Notes in Computer Science, No. 56, Springer, 1977, pp. 152-165. [MR: 486262] [Zbl: 0374.94010] [Google Scholar]
  3. 3. J. F. PERROT, Variétés des langages et opérations, Theoretical Computer Science, Vol. 7, 1978, pp. 198-210. [MR: 509017] [Zbl: 0398.68035] [Google Scholar]
  4. 4. J. E. PIN, Sur le monoïde syntactique de L* lorsque L est un langage fini, Theoretical Computer Science, Vol. 7, 1978, pp. 211-215. [MR: 509018] [Zbl: 0388.20050] [Google Scholar]
  5. 5. J. E. PIN, Variétés de langages et monoïde des parties, to appear in Semigroup Forum. [EuDML: 134401] [MR: 572533] [Zbl: 0451.20061] [Google Scholar]
  6. 6. A. RESTIVO, Codes and Aperiodic Languages, in Fachtagung übër Automatentheorie und formale Sprachen, Lecture Notes in Computer Science, No. 2, Springer, 1973, pp. 175-181. [MR: 434009] [Zbl: 0277.68039] [Google Scholar]
  7. 7. C. REUTENAUER, Sur les variétés de langages et de monoïdes, 4th G. I. Conference, Lecture Notes in Computer Science, No. 67, Springer, 1979, pp. 260-265. [MR: 568110] [Zbl: 0411.68066] [Google Scholar]
  8. 8. M. P. SCHÜTZENBERGER, On Finite Monoids Having Only Trivial Subgroups, Information and Control, Vol. 8, 1965, pp. 190-194. [MR: 176883] [Zbl: 0131.02001] [Google Scholar]
  9. 9. M. P. SCHÜTZENBERGER, Sur le produit de concatenation non ambigu, Semigroup Forum, Vol. 13, 1976, pp. 47-75. [EuDML: 134196] [MR: 444824] [Zbl: 0373.20059] [Google Scholar]
  10. 10. H. STRAUBING, Aperiodic Homomorphisms and The Concatenation Product of Recognizable Sets, J. Pure and Applied Algebra, Vol. 15, 1979, pp. 319-327. [MR: 537504] [Zbl: 0407.20056] [Google Scholar]
  11. 11. H. STRAUBING, A Generalization of the Schützenberger Product of Finite Monoids, to appear in Theoretical Computer Science, Vol. 12, 1980. [MR: 594057] [Zbl: 0456.20048] [Google Scholar]
  12. 12. H. STRAUBING, Recognizable Sets and Power Sets of Finite Semigroups, Semigroup Forum, Vol. 18, 1979, pp. 331-340. [EuDML: 134363] [MR: 552376] [Zbl: 0433.20045] [Google Scholar]
  13. 13. B. TILSON, Chapter XII in Reference [1]. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.