{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:34Z","timestamp":1725577414426},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_8","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"69-78","source":"Crossref","is-referenced-by-count":1,"title":["Regular Geometrical Languages and Tiling the Plane"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Philippe","family":"Dubernard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadrien","family":"Jeanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01995675","volume":"2","author":"S.K. Baruah","year":"1990","unstructured":"Baruah, S.K., Rosier, L.E., Howell, R.R.: Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems\u00a02(4), 301\u2013324 (1990)","journal-title":"Real-Time Systems"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02574705","volume":"6","author":"D. Beauquier","year":"1991","unstructured":"Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete & Computational Geometry\u00a06, 575\u2013592 (1991)","journal-title":"Discrete & Computational Geometry"},{"key":"8_CR3","unstructured":"Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometrical languages. In: Martin Vide, C. (ed.) International Conference on Language Theory and Automata (LATA 2007), vol.\u00a035\/07, GRLMC Universitat Rovira I Virgili (2007)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-13089-2_15","volume-title":"Language and Automata Theory and Applications","author":"J.-M. Champarnaud","year":"2010","unstructured":"Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: Geometricity of binary regular languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 178\u2013189. Springer, Heidelberg (2010)"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1142\/S0129054109006863","volume":"20","author":"J.-M. Champarnaud","year":"2009","unstructured":"Champarnaud, J.-M., Dubernard, J.-P., Jeanne, H.: An efficient algorithm to test whether a binary and prolongeable regular language is geometrical. Int. J. Found. Comput. Sci.\u00a020(4), 763\u2013774 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR6","volume-title":"Automata, languages and machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, languages and machines, vol.\u00a0B. Academic Press, New York (1976)"},{"issue":"1-3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2007.03.054","volume":"388","author":"D. Geniet","year":"2007","unstructured":"Geniet, D., Largeteau, G.: Wcet free time analysis of hard real-time systems on multiprocessors: A regular language-based model. Theor. Comput. Sci.\u00a0388(1-3), 26\u201352 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","volume-title":"Polyominoes: Puzzles, patterns, problems, and packings","author":"S.W. Golomb","year":"1996","unstructured":"Golomb, S.W.: Polyominoes: Puzzles, patterns, problems, and packings. Princeton Academic Press, London (1996)"},{"key":"8_CR9","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, Ann. Math. Studies\u00a034, 3\u201341 (1956)","journal-title":"Automata Studies, Ann. Math. Studies"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-31965-8_3","volume-title":"Discrete Geometry for Computer Imagery","author":"G. Largeteau-Skapin","year":"2005","unstructured":"Largeteau-Skapin, G., Geniet, D., Andres, E.: Discrete geometry applied in hard real-time systems validation. In: Andr\u00e8s, \u00c9., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol.\u00a03429, pp. 23\u201333. Springer, Heidelberg (2005)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(94)90107-4","volume":"127","author":"A.D. Lungo","year":"1994","unstructured":"Lungo, A.D.: Polyominoes defined by two vectors. Theor. Comput. Sci.\u00a0127(1), 187\u2013198 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR12","first-page":"112","volume":"TR-57-624","author":"J. Myhill","year":"1957","unstructured":"Myhill, J.: Finite automata and the representation of events. WADD\u00a0TR-57-624, 112\u2013137 (1957)","journal-title":"WADD"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automata transformation. In: Proceedings of AMS, vol.\u00a09, pp. 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:18:28Z","timestamp":1559989108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}