{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:21Z","timestamp":1759638021195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_10","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Additive Number Theory via Approximation by Regular Languages"],"prefix":"10.1007","author":[{"given":"Jason P.","family":"Bell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas F.","family":"Lidbetter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications. Cambridge University Press, Generalizations (2003)"},{"key":"10_CR2","unstructured":"Banks, W.D.: Every natural number is the sum of forty-nine palindromes. Integers: Elect. J. of Combin. Number Theor. 16 (2016). paper #A3"},{"key":"10_CR3","unstructured":"Bell, J., Hare, K., Shallit, J.: When is an automatic set an additive basis? (2017). \n                    https:\/\/arxiv.org\/abs\/1710.08353\n                    \n                  . To appear, Proc. Amer. Math. Soc"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, vol. 35, pp. 118\u2013161. North-Holland (1963)","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Cilleruelo, J., Luca, F., Baxter, L.: Every positive integer is a sum of three palindromes. Math. Comp. (2017). \n                    https:\/\/doi.org\/10.1090\/mcom\/3221","DOI":"10.1090\/mcom\/3221"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2007.07.032","volume":"387","author":"B Cordy","year":"2007","unstructured":"Cordy, B., Salomaa, K.: On the existence of regular approximations. Theor. Comput. Sci. 387, 125\u2013135 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/321466.321470","volume":"15","author":"J Hartmanis","year":"1968","unstructured":"Hartmanis, J., Shank, H.: On the recognition of primes by automata. J. Assoc. Comput. Mach. 15, 382\u2013389 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"10_CR9","first-page":"441","volume":"23","author":"S Horv\u00e1th","year":"1987","unstructured":"Horv\u00e1th, S., Karhum\u00e4ki, J., Kleijn, J.: Results concerning palindromicity. J. Inf. Process. Cybern. EIK 23, 441\u2013451 (1987)","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Mohri, M., Nederhof, M.J.: Regular approximation of context-free grammars through transformation. In: Junqua, J.C., Noord, G.v. (eds.) Robustness in Language and Speech Technology, Text, Speech and Language Technology, vol. 17, pp. 153\u2013163. Springer, Dordrecht (2001). \n                    https:\/\/doi.org\/10.1007\/978-94-015-9719-7_6","DOI":"10.1007\/978-94-015-9719-7_6"},{"key":"10_CR11","unstructured":"Mousavi, H.: Automatic theorem proving in Walnut preprint available at (2016) \n                    https:\/\/arxiv.org\/abs\/1603.06017"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3845-2","volume-title":"Additive Number Theory: The Classical Bases","author":"MB Nathanson","year":"1996","unstructured":"Nathanson, M.B.: Additive Number Theory: The Classical Bases. Springer, Heidelberg (1996). \n                    https:\/\/doi.org\/10.1007\/978-1-4757-3845-2"},{"key":"10_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b98870","volume-title":"Elementary Methods in Number Theory","author":"MB Nathanson","year":"2000","unstructured":"Nathanson, M.B.: Elementary Methods in Number Theory. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/b98870"},{"key":"10_CR14","unstructured":"Rajasekaran, A., Smith, T., Shallit, J.: Sums of palindromes: an approach via automata. In: Niedermeier, R., Vall\u00e9e, B. (eds.) International Proceedings in Informatics, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), pp. 54:1\u201354:12. Leibniz (2018)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"DR Raymond","year":"1994","unstructured":"Raymond, D.R., Wood, D.: Grail: a C++ library for automata and expressions. J. Symbolic Comput. 17, 341\u2013350 (1994)","journal-title":"J. Symbolic Comput."},{"key":"10_CR16","unstructured":"Sloane, N.J.A., et al.: The on-line encyclopedia of integer sequences available at (2018). \n                    https:\/\/oeis.org"}],"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-319-98654-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:10:30Z","timestamp":1535915430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}