Free Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 26, Number 6, 1992
|
|
|---|---|---|
| Page(s) | 541 - 552 | |
| DOI | https://doi.org/10.1051/ita/1992260605411 | |
| Published online | 01 February 2017 | |
- 1. R. CORI et D. PERRIN, Sur la reconnaissabilité dans les monoïdes partiellement commutatif libres, R.A.I.R.O. Inform. Théor. Appl., 1985, 19, p. 21-32. [EuDML: 92219] [MR: 795769] [Zbl: 0601.68055] [Google Scholar]
- 2. R. CORI et Y. MÉTIVIER, Recognizable Subsets of Partially Abelian Monoids Theoret. Comput. Sci., 1985, 35, p. 179-189. [MR: 785150] [Zbl: 0559.20040] [Google Scholar]
- 3. S. EILENBERG, Automata, languages and machines, A, Academic Press, 1974. [Google Scholar]
- 4. M. FLIESS, Matrices de Hankel, J. Math. Pures Appl., 1974, 53, p. 197-224. [MR: 364328] [Zbl: 0315.94051] [Google Scholar]
- 5. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
- 6. Y. MÉTIVIER, Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif, R.A.I.R.O., Inform. Theor. Appl., 1986, 20, p. 121-127. [EuDML: 92251] [MR: 860764] [Zbl: 0599.20107] [Google Scholar]
- 7. Y. MÉTIVIER, On Recognizable Subsets of Free Partially Commutative Monoids, Theoret. Comput. Sci., 1988, 58, p. 201-208. [MR: 963263] [Zbl: 0658.20031] [Google Scholar]
- 8. E. OCHMANSKI, Regular Behaviour of Concurrent Systems, E.A.T.C.S. Bull., octobre 1985. [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.