Author:
Kolarz Michał,Moczurad Włodzimierz
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science 147(1-2), 165–180 (1995)
2. Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoretical Computer Science 303(2-3), 417–430 (2003)
3. Blanchet-Sadri, F.: On unique, multiset, set decipherability of three-word codes. IEEE Transactions on Information Theory 47(5), 1745–1757 (2001)
4. Blanchet-Sadri, F., Morgan, C.: Multiset and set decipherable codes. Computers and Mathematics with Applications 41(10-11), 1257–1262 (2001)
5. Burderi, F., Restivo, A.: Coding partitions. Discrete Mathematics and Theoretical Computer Science 9(2), 227–240 (2007)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Dimensional Codes;Lecture Notes in Computer Science;2020
2. Sets of Pictures Avoiding Overlaps;International Journal of Foundations of Computer Science;2019-09
3. Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties;Cellular Automata and Discrete Complex Systems;2017
4. Avoiding Overlaps in Pictures;Descriptional Complexity of Formal Systems;2017
5. Structure and properties of strong prefix codes of pictures;Mathematical Structures in Computer Science;2015-05-28