{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:43:59Z","timestamp":1751093039733,"version":"3.40.3"},"publisher-location":"London","reference-count":17,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447142751"},{"type":"electronic","value":"9781447142768"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4471-4276-8_2","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T18:19:09Z","timestamp":1343326749000},"page":"23-43","source":"Crossref","is-referenced-by-count":1,"title":["Languages, Decidability, and Complexity"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Haar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Masopust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"2001","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem, 2nd edn. Springer, Berlin (2001)","edition":"2"},{"key":"2_CR2","volume-title":"Introduction to the Theory of Complexity","author":"D.P. Bovet","year":"1994","unstructured":"Bovet, D.P., Crescenzi, P.: Introduction to the Theory of Complexity. Prentice Hall, New York (1994)"},{"key":"2_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)"},{"key":"2_CR4","volume-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)"},{"key":"2_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 3rd edn. Addison Wesley, Boston (2006)","edition":"3"},{"issue":"7","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1142\/S0129054111008933","volume":"22","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Masopust, T.: Complexity in union-free regular languages. International Journal of Foundations of Computer Science\u00a022(7), 1639\u20131653 (2011)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"2_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity from a Programming Perspective","author":"N.D. Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity from a Programming Perspective. MIT Press, Cambridge (1997)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"D.C. Kozen","year":"1997","unstructured":"Kozen, D.C.: Automata and Computability. Springer, Berlin (1997)"},{"key":"2_CR9","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.: Computational Complexity. Addison Wesley, Boston (1993)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-59136-5","volume-title":"Handbook of Formal Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, pp. 1\u20133. Springer, Berlin (1997)"},{"key":"2_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, New York (2009)"},{"key":"2_CR12","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"2_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107325630","volume-title":"Computation and Automata","author":"A. Salomaa","year":"1985","unstructured":"Salomaa, A.: Computation and Automata. Cambridge University Press, Cambridge (1985)"},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J. Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, New York (2008)"},{"key":"2_CR15","unstructured":"Sipser, M.: Introduction to the Theory of Computation, Course Technology, 2nd edn., Boston, MA (2005)"},{"key":"2_CR16","volume-title":"Languages and Machines: An Introduction to the Theory of Computer Science","author":"T. Sudkamp","year":"2005","unstructured":"Sudkamp, T.: Languages and Machines: An Introduction to the Theory of Computer Science, 3rd edn. Addison Wesley, Boston (2005)","edition":"3"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing Machines with Sublogarithmic Space","author":"A. Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. Springer, Berlin (1994)"}],"container-title":["Lecture Notes in Control and Information Sciences","Control of Discrete-Event Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4276-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T08:39:50Z","timestamp":1675931990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4276-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781447142751","9781447142768"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4276-8_2","relation":{},"ISSN":["0170-8643","1610-7411"],"issn-type":[{"type":"print","value":"0170-8643"},{"type":"electronic","value":"1610-7411"}],"subject":[],"published":{"date-parts":[[2013]]}}}