{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:45Z","timestamp":1725562785534},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153808"},{"type":"electronic","value":"9783642153815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15381-5_30","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T07:50:11Z","timestamp":1282377011000},"page":"242-250","source":"Crossref","is-referenced-by-count":2,"title":["Directed Figure Codes with Weak Equality"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Moczurad","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00201-S","volume":"147","author":"P. Aigrain","year":"1995","unstructured":"Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science\u00a0147(1-2), 165\u2013180 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"30_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0304-3975(03)00029-X","volume":"303","author":"D. Beauquier","year":"2003","unstructured":"Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoretical Computer Science\u00a0303(2-3), 417\u2013430 (2003)","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2005.03.028","volume":"337","author":"G. Costagliola","year":"2005","unstructured":"Costagliola, G., Ferrucci, F., Gravino, C.: Adding symbolic information to picture models: definitions and properties. Theoretical Computer Science\u00a0337, 51\u2013104 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/FI-1996-253411","volume":"25","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional finite state recognizability. Fundamenta Informaticae\u00a025(3), 399\u2013422 (1996)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2007.09.011","volume":"389","author":"V. Halava","year":"2007","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: Relational codes of words. Theoretical Computer Science\u00a0389(1-2), 237\u2013249 (2007)","journal-title":"Theoretical Computer Science"},{"key":"30_CR6","unstructured":"Kolarz, M.: Directed figures: extended models. Theoretical Informatics and Applications RAIRO (submitted), http:\/\/www.ii.uj.edu.pl\/~kolarz\/ita09010.pdf"},{"issue":"2","key":"30_CR7","first-page":"1","volume":"11","author":"M. Kolarz","year":"2009","unstructured":"Kolarz, M., Moczurad, W.: Directed figure codes are decidable. Discrete Mathematics and Theoretical Computer Science\u00a011(2), 1\u201314 (2009)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0304-3975(99)00317-5","volume":"255","author":"S. Mantaci","year":"2001","unstructured":"Mantaci, S., Restivo, A.: Codes and equations on trees. Theoretical Computer Science\u00a0255, 483\u2013509 (2001)","journal-title":"Theoretical Computer Science"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1080\/00207160008804929","volume":"74","author":"W. Moczurad","year":"2000","unstructured":"Moczurad, W.: Brick codes: families, properties, relations. International Journal of Computer Mathematics\u00a074, 133\u2013150 (2000)","journal-title":"International Journal of Computer Mathematics"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15381-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:58Z","timestamp":1606187158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15381-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153808","9783642153815"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15381-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}