{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:29:06Z","timestamp":1743128946932,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642225994"},{"type":"electronic","value":"9783642226007"}],"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-22600-7_9","type":"book-chapter","created":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T20:58:15Z","timestamp":1311109095000},"page":"107-120","source":"Crossref","is-referenced-by-count":1,"title":["Geometrical Regular Languages and Linear Diophantine Equations"],"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":"Franck","family":"Guingne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadrien","family":"Jeanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Blanpain, B., Champarnaud, J.-M., Dubernard, J.P.: Geometrical languages. In: Martin-Vide, C. (ed.) International Conference on Language Theory and Automata (LATA 2007). GRLMC Universitat Rovira I Virgili, vol.\u00a035(07), pp. 127\u2013138 (2007)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A. Brauer","year":"1942","unstructured":"Brauer, A.: On a problem of partitions. Amer. J. Math.\u00a064, 299\u2013312 (1942)","journal-title":"Amer. J. Math."},{"key":"9_CR3","unstructured":"Carpentier, F.: Syst\u00e8mes d\u2019\u00e9quations diophantiennes et test de g\u00e9om\u00e9tricit\u00e9 sur un langage rationnel. Rapport de master, Universit\u00e9 de Rouen, France (2008)"},{"key":"9_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)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-18098-9_8","volume-title":"Implementation and Application of Automata","author":"J.-M. Champarnaud","year":"2011","unstructured":"Champarnaud, J.-M., Dubernard, J.P., Jeanne, H.: Regular geometrical languages and tiling the plane. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol.\u00a06482, pp. 69\u201378. Springer, Heidelberg (2011)"},{"key":"9_CR6","unstructured":"Champarnaud, J.-M., Hansel, G.: Puissances des matrices bool\u00e9ennes. Unsubmitted manuscript, Universit\u00e9 de Rouen, France (2005)"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci.\u00a047(3), 149\u2013158 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR8","unstructured":"d\u2019Alessandro, F., Intrigila, B., Varricchio, S.: On some counting problems for semi-linear sets. CoRR, abs\/0907.3005 (2009)"},{"key":"9_CR9","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)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-14684-8_9","volume-title":"Finite-State Methods and Natural Language Processing","author":"J. Geldenhuys","year":"2010","unstructured":"Geldenhuys, J., van der Merwe, B., van Zijl, L.: Reducing nondeterministic finite automata with SAT solvers. In: Yli-Jyr\u00e4, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) FSMNLP 2009. LNCS, vol.\u00a06062, pp. 81\u201392. Springer, Heidelberg (2010)"},{"issue":"1-3","key":"9_CR11","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":"9_CR12","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":"9_CR13","unstructured":"LinBox Group. Linbox project: Exact computational linear algebra (2002), \n                    \n                      http:\/\/www.linalg.org"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1090\/S0002-9939-1958-0097416-8","volume":"9","author":"J.C. Holladay","year":"1958","unstructured":"Holladay, J.C., Varga, R.S.: On powers of non negative matrices. Proc. Amer. Math. Soc.\u00a09(4), 631\u2013634 (1958)","journal-title":"Proc. Amer. Math. Soc."},{"key":"9_CR15","first-page":"3","volume":"34","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies\u00a034, 3\u201341 (1956); Ann. Math. Studies","journal-title":"Automata Studies"},{"key":"9_CR16","volume-title":"Diophantine equations","author":"L. Mordell","year":"1969","unstructured":"Mordell, L.: Diophantine equations. Academic Press, London (1969)"},{"issue":"4","key":"9_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jsc.2003.07.004","volume":"37","author":"T. Mulders","year":"2004","unstructured":"Mulders, T., Storjohann, A.: Certified dense linear system solving. J. Symb. Comput.\u00a037(4), 485\u2013510 (2004)","journal-title":"J. Symb. Comput."},{"key":"9_CR18","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":"9_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automata transformation. Proceedings of AMS\u00a09, 541\u2013544 (1958)","journal-title":"Proceedings of AMS"},{"key":"9_CR20","unstructured":"Parantho\u00ebn, T.: G\u00e9n\u00e9ration al\u00e9atoire et structure des automates \u00e0 \u00e9tats finis. PhD, Universit\u00e9 de Rouen, France (2004)"},{"issue":"4","key":"9_CR21","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"},{"key":"9_CR22","first-page":"671","volume-title":"Graph Theory with Applications to Algorithms and Computer Science","author":"R.W. Robinson","year":"1985","unstructured":"Robinson, R.W.: Counting strongly connected finite automata. In: Alavi, Y., et al. (eds.) Graph Theory with Applications to Algorithms and Computer Science, pp. 671\u2013685. Wiley, New York (1985)"},{"key":"9_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1986)"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0202017","volume":"2","author":"R.E. Tarjan","year":"1973","unstructured":"Tarjan, R.E.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput.\u00a02, 211\u2013216 (1973)","journal-title":"SIAM J. Comput."},{"key":"9_CR26","unstructured":"The Polylib Team. Polylib User\u2019s Manual. IRISA, France (2002), \n                    \n                      www.irisa.fr\/polylib\/doc\/"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22600-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T08:41:22Z","timestamp":1553935282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22600-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642225994","9783642226007"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22600-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}