Decision problems and regular chain code picture languages

DOI10.1016/0166-218X(93)90138-EzbMath0797.68096MaRDI QIDQ686522

Friedhelm Hinz, Juergen Dassow

Publication date: 2 December 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decidability; picture languages; picture processing; string language

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Tree-based generation of languages of fractals, Two undecidability results for chain code picture languages, Adding symbolic information to picture models: definitions and properties, Generating self-affine fractals by collage grammars, Perfectly quilted rectangular snake tilings, Retreat bounded picture languages, Unambiguous description of chain code picture languages, Leftmove-bounded picture languages, Undecidability of existential properties in picture languages, LINKS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An undecidable problem about rational sets and contour words of polyominoes
• On the connectedness of pictures in chain code picture languages
• Complexity and decidability for restricted classes of picture languages
• Picture iteration and picture ambiguity
• Complexity and decidability for chain code picture languages
• The membership and equivalence problems for picture languages
• Using string languages to describe picture languages
• Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats