Author:
Moczurad Małgorzata,Moczurad Włodzimierz
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoret. Comp. Sci. 147, 165–180 (1995)
2. Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoret. Comp. Sci. 303, 417–430 (2003)
3. Karhumäki, J.: Some open problems in combinatorics of words and related areas. TUCS Technical Report, vol. 359 (2000)
4. Margenstern, M.: Frontiers between decidability and undecidability: a survey. Theoret. Comp. Sci. 231, 217–251 (2000)
5. Matiyasevich, Y.: Simple examples of undecidable associative calculi. Soviet Math. Dokladi 8, 555–557 (1967)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Dimensional Codes;Lecture Notes in Computer Science;2020
2. Toroidal Codes and Conjugate Pictures;Language and Automata Theory and Applications;2019
3. Encoding Pictures with Maximal Codes of Pictures;SOFSEM 2018: Theory and Practice of Computer Science;2017-12-22
4. Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties;Cellular Automata and Discrete Complex Systems;2017
5. Picture Codes with Finite Deciphering Delay;Language and Automata Theory and Applications;2014