{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:45Z","timestamp":1760202645321},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_7","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"62-72","source":"Crossref","is-referenced-by-count":2,"title":["Decidability of Geometricity of Regular Languages"],"prefix":"10.1007","author":[{"given":"Marie-Pierre","family":"B\u00e9al","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","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"}]},{"given":"Sylvain","family":"Lombardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(86)90087-6","volume":"23","author":"M. Benois","year":"1986","unstructured":"Benois, M., Sakarovitch, J.: On the complexity of some extended word problems defined by cancellation rules. Inform. Process. Lett.\u00a023, 281\u2013287 (1986)","journal-title":"Inform. Process. Lett."},{"key":"7_CR2","unstructured":"Blanpain, B., Champarnaud, J.-M., Dubernard, J.-P.: Geometrical languages. In: LATA (Languages and Automata Theoretical Aspects), vol.\u00a0Pre-proceedings, Report 35\/07 of GRLMC Universitat Rovira I Virgili, pp.\u00a0127\u2013138 (2007)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-642-22600-7_9","volume-title":"DCFS 2011","author":"J.-M. Champarnaud","year":"2011","unstructured":"Champarnaud, J.-M., Dubernard, J.-P., Guingne, F., Jeanne, H.: Geometrical Regular Languages and Linear Diophantine Equations. In: Holzer, M. (ed.) DCFS 2011. LNCS, vol.\u00a06808, pp. 107\u2013120. Springer, Heidelberg (2011)"},{"key":"7_CR4","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, 763\u2013774 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR5","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":"7_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.P.: Rational sets in commutative monoids. J. Algebra\u00a013, 173\u2013191 (1969)","journal-title":"J. Algebra"},{"key":"7_CR7","unstructured":"Fischer, M.J., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Complexity of computation (Proc. SIAM-AMS Sympos., New York, 1973). SIAM\u2013AMS Proc., vol.\u00a0VII, pp. 27\u201341. Amer. Math. Soc., Providence (1974)"},{"key":"7_CR8","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. Theoret. Comput. Sci.\u00a0388, 26\u201352 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","first-page":"333","volume":"113","author":"S. Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Trans. Amer. Math. Soc.\u00a0113, 333\u2013368 (1964)","journal-title":"Trans. Amer. Math. Soc."},{"key":"7_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9780691215051","volume-title":"Polyominoes","author":"S.W. Golomb","year":"1994","unstructured":"Golomb, S.W.: Polyominoes, 2nd edn. Princeton University Press, Princeton (1994); Puzzles, patterns, problems, and packings, With diagrams by Warren Lushbaugh, With an appendix by Andy Liu","edition":"2"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-10003-2_81","volume-title":"Automata, Languages and Programming","author":"T.-D. Huynh","year":"1980","unstructured":"Huynh, T.-D.: The Complexity of Semilinear Sets. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol.\u00a085, pp. 324\u2013337. Springer, Heidelberg (1980)"},{"key":"7_CR12","unstructured":"Reutenauer, C.: Aspects math\u00e9matiques des r\u00e9seaux de Petri, Collection \u00c9tudes et Recherches en Informatique, Masson, Paris, ch.\u00a03 (1989)"},{"key":"7_CR13","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates, Vuibert (2003)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"7_CR15","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003); 1st edn. (1999)","edition":"2"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Sieveking, M.: A bound on solutions of linear integer equalities and inequalities. In: Proceedings of the American Mathematical Society, vol.\u00a072, pp. 155\u2013158 (1978)","DOI":"10.2307\/2042554"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T05:45:08Z","timestamp":1642743908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}