Efficient reductions of picture words

Franz J. Brandenburg; Jürgen Dassow

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1993)

  • Volume: 27, Issue: 1, page 49-56
  • ISSN: 0988-3754

How to cite

top

Brandenburg, Franz J., and Dassow, Jürgen. "Efficient reductions of picture words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 27.1 (1993): 49-56. <http://eudml.org/doc/92437>.

@article{Brandenburg1993,
author = {Brandenburg, Franz J., Dassow, Jürgen},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {reduction rules; Euler tour; grid graph},
language = {eng},
number = {1},
pages = {49-56},
publisher = {EDP-Sciences},
title = {Efficient reductions of picture words},
url = {http://eudml.org/doc/92437},
volume = {27},
year = {1993},
}

TY - JOUR
AU - Brandenburg, Franz J.
AU - Dassow, Jürgen
TI - Efficient reductions of picture words
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1993
PB - EDP-Sciences
VL - 27
IS - 1
SP - 49
EP - 56
LA - eng
KW - reduction rules; Euler tour; grid graph
UR - http://eudml.org/doc/92437
ER -

References

top
  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. Zbl0326.68005MR413592
  2. 2. J. EDMONDS and E. L. JOHNSON, Matching, Euler Tours and the Chinese Postman, Math. Programming, 1973, 5, pp. 88-124. Zbl0281.90073MR321801
  3. 3. S. EVEN, Graph Algorithms, Computer Science Press, 1979. Zbl0441.68072MR540205
  4. 4. R. GUTBROD, A Transformation System for Generating Description Languages of Chain Code Pictures, Theoret. Comput. Sci., 1989, 68, pp. 239-252. Zbl0678.68067MR1031959
  5. 5. F. HINZ, Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity, Lecture Notes in Computer Science, 1986, 233, pp. 414-421. Zbl0617.68070MR874619
  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. MR1027396
  7. 7. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, 1979. Zbl0426.68001MR645539
  8. 8. H. A. MAURER, G. ROZENBERG and E. WELZL, Using String Languages to Describe Picture Languages, Inform. Contr., 1982, 54, pp. 155-185. Zbl0523.68065MR719441
  9. 9. A. SCHÖNHAGE, Real-Time Simulation of Multidimensional Turing Machines by Storage Modification Machines, SIAM J. Comput. 1980, 9, pp. 490-508. Zbl0454.68034
  10. 10. P. SÉÉBOLD and K. SLOWINSKI, Minimizing Picture Words, Lecture Notes in Computer Science, 1990, 464, pp. 234-243. Zbl0735.68053MR1086416
  11. 11. I. H. SUDBOROUGH and E. WELZL, Complexity and Decidability for Chain Code Picture Languages, Theoret. Comput. Sci., 1985, 36, pp. 172-202. Zbl0565.68065MR796298

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.