Chain-code pictures and collages generated by hyperedge replacement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1073, Issue , 1996, Pages 412-427

  Dassow, Jiirgen ^a   Habel, Annegret ^b   Taubenberger, Stefan ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b UNIVERSITY OF HILDESHEIM   (Germany)

^c NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

CHAIN CODE PICTURES; CHAIN CODES; HYPEREDGE REPLACEMENT; PICTURE LANGUAGES; UNDECIDABILITY;

CODES (SYMBOLS);

EID: 84947748993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_102     Document Type: Conference Paper

References (17)

1. Daniéle Beauquier. An undecidability problem about rational sets and contour words of polyominoes. Information Processing Letters 37, 257-263, 1991.
2. Claude Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973.
3. H S M. Coxeter. Introduction to Geometry. Wiley Classics Library Edition, John Wiley & Sons, Inc, New York, second edition edition, 1989.
4. Jürgen Dassow, Friedhelm Hinz. Decision problems and regular chain code picture languages. Discrete Applied Mathematics 45, 29-49, 1993.
5. Frank Drewes. Language theoretic and algorithmic properties of collages and pattern living in a grid. Journal of Computer and System Sciences, 1995. To appear.
6. Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science 145, 159-187, 1995.
7. Frank Drewes, Hans-Jörg Kreowski. (Un-)decidability of geometric properties of pictures generated by collage grammars. Ftmdamenta Informaticae, 1995. To appear.
8. Simant Dube. Fractal geometry, turing machines and divide-and-conquer recurrences. RAIRO Theoretical Informatics and Applications 28, 405-423, 1994.
9. Annegret Habel, Hans-Jörg Kreowski. Pretty patterns produced by hyperedge replacement. In H. Göttler, H. J. Schneider, eds, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 314, 32-45, 1988.
10. Annegret Habel, Hans-Jörg Kreowski. Collage grammars. In H. Ehrig, H. -J. Kreowski, G. Rozenberg, eds, Graph Grammars and Their Application to Computer Science, Lecture Notes in Conlputer Science 532, 411-429, 1991.
11. Annegret Habel, Hans-JSrg Kreowski, Stefan Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design 1, 125-145, 1993.
12. Jolm E. Hopcroft, Jeffrey D Ullman. Introduction to Automata Theory, Languages and Compuation. Addison-Wesley, Reading, Mass, 1979.
13. Changwook Kim. Complexity and decidability for restricted classes of picture languages. Theoretical Computer Science 73, 295-311, 1990.
14. Hermaml A Maurer, Grzegorz Rozenberg, Emo Welzl. Using string languages to describe picture languages. Information and Control 54, 155-185, 1982.
15. Denis Robilliard. Undecidable questions in picture languages. Technical Report IT 262, Universitäde Lille, 1994.
16. Ivan Hal Sudborough, Emo Welzl. Complexity and decidability for chain code picture languages. Theoretical Computer Science 36, 173-202, 1985.
17. Stefan Taubenberger. Correct translations of generalized iterated function systems to collage grammars. Technical Report 7/94, Bremen, 1994.