Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati. On the Complexity of Unary Tiling-Recognizable Picture Languages. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 381-392, Springer, 2007. [doi]
@inproceedings{BertoniGL07, title = {On the Complexity of Unary Tiling-Recognizable Picture Languages}, author = {Alberto Bertoni and Massimiliano Goldwurm and Violetta Lonati}, year = {2007}, doi = {10.1007/978-3-540-70918-3_33}, url = {http://dx.doi.org/10.1007/978-3-540-70918-3_33}, researchr = {https://researchr.org/publication/BertoniGL07}, cites = {0}, citedby = {0}, pages = {381-392}, booktitle = {STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings}, editor = {Wolfgang Thomas and Pascal Weil}, volume = {4393}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-540-70917-6}, }