Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 20, Number 2, 1986
Page(s) 121 - 127
DOI https://doi.org/10.1051/ita/1986200201211
Published online 01 February 2017
  1. 1. R. CORI et D. PERRIN, Sur la reconnaissabilité dans les monoïdes partiellement commutatifs libres, R.A.I.R.O., Informat, théor. (à paraître).
  2. 2. R. CORIet Y. MÉTIVIER, Rational Subsets of Some Partially Abelian Monoids, Theoret. Comput. Sc. (à paraître). [Zbl: 0559.20040]
  3. 3. M. P. FLÉ et G. ROUCAIROL, Maximal Serializability of Iterated Transaction, Theoret. Comput. Sc. (à paraître) (voir aussi ACM SIGACT SIGOPS, 1982, p. 194-200). [MR: 805130] [Zbl: 0572.68082]
  4. 4. M. LOTHAIRE, Combinatorics on Words, Addison Wesley, 1983. [MR: 675953] [Zbl: 0514.20045]
  5. 5. J.-E. PIN, Variétés de langages formels, Masson, Paris, 1984. [MR: 752695] [Zbl: 0636.68093]

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.