Free Access
RAIRO. Inform. théor.
Volume 19, Number 1, 1985
Page(s) 21 - 32
Published online 01 February 2017
  1. 1. P. CARTIER et D. FOATA, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., n° 85, 1969, Springer Verlag. [MR: 239978] [Zbl: 0186.30101] [Google Scholar]
  2. 2. S. EILENBERG, Automata, Languages and Machines, vol. A, 1974, Academic Press. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  3. 3. M. P. FLÉ et G. ROUCAIROL, On Serializability of Iterated Transaction, A.C.M. SIGACT-SIGOPS, 1982, p. 194-200. [Google Scholar]
  4. 4. M. LOTHAIRE, Combinatorics on Words, 1983, Addison Wesley. [MR: 675953] [Zbl: 0514.20045] [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.