Free Access
RAIRO-Theor. Inf. Appl.
Volume 31, Number 1, 1997
Page(s) 81 - 96
Published online 01 February 2017
  1. 1. J. BERSTEL, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  2. 2. K. CULIK II, New techniques for proving the decidability of equivalence problems, in: T. Lepistö and A. Salomaa (eds.), Automata, Languages and Programming, Springer, Berlin, 1988. [MR: 1023634] [Zbl: 0662.68079] [Google Scholar]
  3. 3. A. EHRENFEUCHT and G. ROZENBERG, On proving that certain languages are not ETOL, Acta Inform., 1976, 6, pp. 407-415. [MR: 411252] [Zbl: 0349.68034] [Google Scholar]
  4. 4. G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, New York, 1980. [MR: 561711] [Zbl: 0508.68031] [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.