EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 1 (1993) RAIRO-Theor. Inf. Appl., 27 1 (1993) 49-56 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 27, Number 1, 1993
Page(s) 49 - 56
DOI https://doi.org/10.1051/ita/1993270100491
Published online 01 February 2017
  1. 1. A. V. AHO. J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison Wesley Publishing Company, Reading, Mass., 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
  2. 2. J. EDMONDS and E. L. JOHNSON, Matching, Euler Tours and the Chinese Postman, Math. Programming, 1973, 5, pp. 88-124. [MR: 321801] [Zbl: 0281.90073] [Google Scholar]
  3. 3. S. EVEN, Graph Algorithms, Computer Science Press, 1979. [MR: 540205] [Zbl: 0441.68072] [Google Scholar]
  4. 4. R. GUTBROD, A Transformation System for Generating Description Languages of Chain Code Pictures, Theoret. Comput. Sci., 1989, 68, pp. 239-252. [MR: 1031959] [Zbl: 0678.68067] [Google Scholar]
  5. 5. F. HINZ, Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity, Lecture Notes in Computer Science, 1986, 233, pp. 414-421. [MR: 874619] [Zbl: 0617.68070] [Google Scholar]
  6. 6. F. HINZ, Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant Retreats, Lecture Notes in Computer Science, 1989, 349, pp. 132-143. [MR: 1027396] [Google Scholar]
  7. 7. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, 1979. [MR: 645539] [Zbl: 0426.68001] [Google Scholar]
  8. 8. H. A. MAURER, G. ROZENBERG and E. WELZL, Using String Languages to Describe Picture Languages, Inform. Contr., 1982, 54, pp. 155-185. [MR: 719441] [Zbl: 0523.68065] [Google Scholar]
  9. 9. A. SCHÖNHAGE, Real-Time Simulation of Multidimensional Turing Machines by Storage Modification Machines, SIAM J. Comput. 1980, 9, pp. 490-508. [Zbl: 0454.68034] [Google Scholar]
  10. 10. P. SÉÉBOLD and K. SLOWINSKI, Minimizing Picture Words, Lecture Notes in Computer Science, 1990, 464, pp. 234-243. [MR: 1086416] [Zbl: 0735.68053] [Google Scholar]
  11. 11. I. H. SUDBOROUGH and E. WELZL, Complexity and Decidability for Chain Code Picture Languages, Theoret. Comput. Sci., 1985, 36, pp. 172-202. [MR: 796298] [Zbl: 0565.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.