Directed figure codes: decidability frontier

DOI10.1142/S1793830910000814MaRDI QIDQ3084680zbMATH OpenFDO

Authors Michał Kolarz

Publication date 25 March 2011

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

variable-length codescodicity verificationdirected figures

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Combinatorics on words (68R15)

Recommendations

• Directed figure codes: decidability frontier
• The code problem for directed figures
• scientific article; zbMATH DE number 5761821
• Decidability of multiset, set and numerically decipherable directed figure codes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• A codicity undecidable problem in the plane.
• Adding symbolic information to picture models: definitions and properties
• Codes and equations on trees
• Decidability of code properties
• Polyomino tilings, cellular automata and codicity

Cited in

(6)

• Decidability of involution hypercodes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Directed figure codes: decidability frontier
• scientific article; zbMATH DE number 5761821 (Why is no real title available?)
• Decidability of multiset, set and numerically decipherable directed figure codes
• The code problem for directed figures

This page was built for publication: Directed figure codes: decidability frontier

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