Free Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 24, Number 4, 1990
|
|
|---|---|---|
| Page(s) | 339 - 352 | |
| DOI | https://doi.org/10.1051/ita/1990240403391 | |
| Published online | 01 February 2017 | |
- J. C. M. BAETEN, J. A. BERGSTRA et J. W. KLOP, Decidability of Bisimulation Equivalence for Processes Generating Context-free Languages, LNCS 259, 1987, p. 94-111. [MR: 910305] [Zbl: 0635.68014] [Google Scholar]
- D. CAUCAL, Décidabilité de l'égalité des langages algébriques infinitaires simples, LNCS 210, 1986, p. 37-48. [MR: 827723] [Zbl: 0595.68072] [Google Scholar]
- D. CAUCAL, On the regular structure of prefix rewritings, Rapport interne 507, CAAP90 paraîtra dans LNCS, 1990. [MR: 1075024] [Zbl: 0786.68047] [Google Scholar]
- P. M. COHN, Universal Algebra, Klumer Academic Publishers Group, 1981. [MR: 620952] [Google Scholar]
- B. COURCELLE, An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, vol. 16, 1983, p. 191-231. [MR: 702448] [Zbl: 0581.68032] [Google Scholar]
- I. GUESSARIAN, Algebraic Semantics, LNCS 99, 1981. [MR: 617908] [Zbl: 0474.68010] [Google Scholar]
- D. MULLER et P. SCHUPP, The Theory of Ends, Pushdown Automata, and Second Order Logic, TCS 37, 1985, p. 51-75. [MR: 796313] [Zbl: 0605.03005] [Google Scholar]
- D. PARK, Concurrency and Automata on Infinite Sequences, LNCS 104, 1981, p. 167-183. [Zbl: 0457.68049] [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.