Decision problems and regular chain code picture languages

DOI10.1016/0166-218X(93)90138-EMaRDI QIDQ686522zbMATHOpenAlexWikidataFDO

Authors Friedhelm Hinz, Jürgen Dassow

Publication date 2 December 1993

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

Full work available at URL https://doi.org/10.1016/0166-218x(93)90138-e

zbMATH Keywords

decidabilitypicture languagespicture processingstring language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Complexity and decidability for chain code picture languages
• Publication:4206414
• Unambiguous description of chain code picture languages
• The membership and equivalence problems for picture languages
• scientific article; zbMATH DE number 4001507

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 18634 (Why is no real title available?)
• scientific article; zbMATH DE number 4126715 (Why is no real title available?)
• scientific article; zbMATH DE number 4121467 (Why is no real title available?)
• scientific article; zbMATH DE number 3451488 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• An undecidable problem about rational sets and contour words of polyominoes
• Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
• Complexity and decidability for chain code picture languages
• Complexity and decidability for restricted classes of picture languages
• On the connectedness of pictures in chain code picture languages
• Picture iteration and picture ambiguity
• The membership and equivalence problems for picture languages
• Using string languages to describe picture languages

Cited in

(24)

• Adding symbolic information to picture models: definitions and properties
• Decision problems for edge grammars
• scientific article; zbMATH DE number 4001507 (Why is no real title available?)
• Language generating alphabetic flat splicing P systems
• Links
• Decidability of the consistency problem for regular symbolic picture description languages
• Two undecidability results for chain code picture languages
• Retreat bounded picture languages
• scientific article; zbMATH DE number 177432 (Why is no real title available?)
• Generating self-affine fractals by collage grammars
• Complexity and decidability for chain code picture languages
• Chain-code pictures and collages generated by hyperedge replacement
• Undecidability of existential properties in picture languages
• Tree-based generation of languages of fractals
• Picture iteration and picture ambiguity
• Leftmove-bounded picture languages
• Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
• The membership and equivalence problems for picture languages
• Unambiguous description of chain code picture languages
• Perfectly quilted rectangular snake tilings
• scientific article; zbMATH DE number 5761821 (Why is no real title available?)
• scientific article; zbMATH DE number 4126715 (Why is no real title available?)
• scientific article; zbMATH DE number 18634 (Why is no real title available?)
• scientific article; zbMATH DE number 165819 (Why is no real title available?)

This page was built for publication: Decision problems and regular chain code picture languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686522)