no. 1
Efficient reductions of picture words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 1, pp. 49-56 
@article{ITA_1993__27_1_49_0,
     author = {Brandenburg, Franz J. and Dassow, J\"urgen},
     title = {Efficient reductions of picture words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {49--56},
     year = {1993},
     publisher = {EDP Sciences},
     volume = {27},
     number = {1},
     mrnumber = {1213420},
     zbl = {0770.68081},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1993__27_1_49_0/}
}
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
SP  - 49
EP  - 56
VL  - 27
IS  - 1
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1993__27_1_49_0/
LA  - en
ID  - ITA_1993__27_1_49_0
ER  - 
%0 Journal Article
%A Brandenburg, Franz J.
%A Dassow, Jürgen
%T Efficient reductions of picture words
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1993
%P 49-56
%V 27
%N 1
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1993__27_1_49_0/
%G en
%F ITA_1993__27_1_49_0
Brandenburg, Franz J.; Dassow, Jürgen. Efficient reductions of picture words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) no. 1, pp. 49-56. https://www.numdam.org/item/ITA_1993__27_1_49_0/

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. | Zbl | MR

2. J. Edmonds and E. L. Johnson, Matching, Euler Tours and the Chinese Postman, Math. Programming, 1973, 5, pp. 88-124. | Zbl | MR

3. S. Even, Graph Algorithms, Computer Science Press, 1979. | Zbl | MR

4. R. Gutbrod, A Transformation System for Generating Description Languages of Chain Code Pictures, Theoret. Comput. Sci., 1989, 68, pp. 239-252. | Zbl | MR

5. F. Hinz, Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity, Lecture Notes in Computer Science, 1986, 233, pp. 414-421. | Zbl | MR

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

7. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Company, 1979. | Zbl | MR

8. H. A. Maurer, G. Rozenberg and E. Welzl, Using String Languages to Describe Picture Languages, Inform. Contr., 1982, 54, pp. 155-185. | Zbl | MR

9. A. Schönhage, Real-Time Simulation of Multidimensional Turing Machines by Storage Modification Machines, SIAM J. Comput. 1980, 9, pp. 490-508. | MR

10. P. Séébold and K. Slowinski, Minimizing Picture Words, Lecture Notes in Computer Science, 1990, 464, pp. 234-243. | Zbl | MR

11. I. H. Sudborough and E. Welzl, Complexity and Decidability for Chain Code Picture Languages, Theoret. Comput. Sci., 1985, 36, pp. 172-202. | Zbl | MR