Free Access
RAIRO-Theor. Inf. Appl.
Volume 30, Number 5, 1996
Page(s) 379 - 413
Published online 01 February 2017
  1. [B79] J. BERSTEL, Transductions and Context-Free Languages, Teubner, Stuttgart, Germany, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  2. [CLR90] T. CORMEN, C. LEISERSON and R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990. [MR: 1066870] [Zbl: 1158.68538] [Google Scholar]
  3. [C90] K. CULIK II, New techniques for proving the decidability of equivalence problems. Theorical Computer Science, 1990, 71, pp. 29-45. [MR: 1050077] [Zbl: 0699.68092] [Google Scholar]
  4. [E74] S. EILENBERG, Automata, Languages, and Machines, Volume A, Academic Press, New York, NY, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  5. [G89] E. GURARI, An Introduction to the Theory of Computation, Computer Science Press, Rockville, MD, 1989. [Google Scholar]
  6. [GI83] E. GURARI and O. IBARRA, A note on finite-valued and finitely ambiguous transducers, Mathematical Systems Theory, 1983, 16, pp. 61-66. [MR: 689490] [Zbl: 0502.68022] [Google Scholar]
  7. [K87] J. KARHUMÄKI, The equivalence of mappings on languages, Proc. 4th IMYCS 1986, in: Lecture Notes in Computer Science, No. 281, Springer-Verlag, Berlin, Heidelberg, Germany, 1987, pp. 26-38. [MR: 921501] [Zbl: 0637.68093] [Google Scholar]
  8. [Le93] H. LEUNG, Separating exponentially ambiguous NFA from polynomially ambiguous NFA, Proc. 4th ISAAC 1993, in: Lecture Notes in Computer Science, No. 762, Springer-Verlag, Berlin, Heidelberg, Germany, 1993, pp. 221-229. [MR: 1288776] [Zbl: 0925.68324] [Google Scholar]
  9. [Li91] L. P. LISOVIK, personal communication, 1991. [Google Scholar]
  10. [LS77] R. LYNDON and P. SCHUPP, Combinatorial Group Theory, Springer-Verlag, Berlin, Heidelberg, Germany, New York, NY, 1977. [MR: 577064] [Zbl: 0368.20023] [Google Scholar]
  11. [Sch76] M. P. SCHÜTZENBERGER, Sur les relations rationnelles entre monoïdes libres, Theoretical Computer Science, 1976, 3, pp. 243-259. [MR: 445927] [Zbl: 0358.68129] [Google Scholar]
  12. [Se94] H. SEIDL, Equivalence of finite-valued tree transducers is decidable, Mathematical Systems Theory, 1994, 27, pp. 285-346. [MR: 1272634] [Zbl: 0809.68087] [Google Scholar]
  13. [W90] A. WEBER, On the valuedness of finite transducers, Acta Informatica, 1990, 27, pp. 749-780. [MR: 1080581] [Zbl: 0672.68027] [Google Scholar]
  14. [W92a] A. WEBER, On the lengths of values in a finite transducer, Acta Informatica, 1992, 29, pp. 663-687. [MR: 1190552] [Zbl: 0790.68038] [Google Scholar]
  15. [W92b] A. WEBER, Decomposing a k-valued transducer into k unambiguous ones, Proc. 1st LATIN 1992, in: Lecture Notes in Computer Science, No. 583, Springer-Verlag, Berlin, Heidelberg, Germany, 1992, pp. 503-515. [MR: 1253375] [Google Scholar]
  16. [W93] A. WEBER, Decomposing finite-valued transducers and deciding their equivalence, SIAM J. Computing, 1993, 22, pp. 175-202. [MR: 1202868] [Zbl: 0767.68079] [Google Scholar]
  17. [W94] A. WEBER, Finite-valued distance automata, Theoretical Computer Science, 1994, 134, pp. 225-251. [MR: 1299375] [Zbl: 0938.68709] [Google Scholar]
  18. [WK95] A. WEBER and R. KLEMM, Economy of description for single-valued transducers, Information and Computation, 1995, 118, pp. 327-340. [MR: 1331733] [Zbl: 0826.68065] [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.