Directed figure codes: decidability frontier

DOI10.1142/S1793830910000814zbMATH Open1211.68298MaRDI QIDQ3084680FDOQ3084680

Authors: Michał Kolarz 

Publication date: 25 March 2011

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

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

zbMATH Keywords

variable-length codescodicity verificationdirected figures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Polyomino tilings, cellular automata and codicity
• A codicity undecidable problem in the plane.
• Decidability of code properties
• Adding symbolic information to picture models: definitions and properties
• Codes and equations on trees

Cited In (6)

• Decidability of involution hypercodes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Directed figure codes: decidability frontier
• Title not available (Why is that?)
• 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)