{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:06:22Z","timestamp":1768266382269,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"value":"354055789X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023779","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"329-338","source":"Crossref","is-referenced-by-count":4,"title":["Quantifier hierarchies over word relations"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Seibert","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","volume-title":"The Theory of Parsing, Translation and Compiling, Vol.1","author":"A.V. Aho","year":"1972","unstructured":"A.V.Aho, J.D.Ullman: The Theory of Parsing, Translation and Compiling, Vol.1, Prentice-Hall, Englewood Cliffs, N.J. 1972"},{"key":"26_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-free Languages","author":"J. Berstel","year":"1979","unstructured":"J.Berstel: Transductions and Context-free Languages, Teubner, Stuttgart 1979"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02017493","volume":"26","author":"J.R. B\u00fcchi","year":"1986\/87","unstructured":"J.R.B\u00fcchi, S.Senger: Coding in the Existential Theory of Concatenation, Arch. Math. Logik 26 (1986\/87), pp. 101\u2013106","journal-title":"Arch. Math. Logik"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/malq.19880340410","volume":"34","author":"J.R. B\u00fcchi","year":"1988","unstructured":"J.R.B\u00fcchi, S.Senger: Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory, Z. Math. Logik Grundlag. Math. 34 (1988), pp. 337\u2013342","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","volume":"2","author":"P.C. Fischer","year":"1968","unstructured":"P.C.Fischer, A.L.Rosenberg: Multitape One-Way Nonwriting Automata, J. Comp. Syst. Sci. 2 (1968), pp. 88\u2013101","journal-title":"J. Comp. Syst. Sci."},{"key":"26_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12898-5","volume-title":"Recursion Theoretic Hierarchies","author":"P.G. Hinman","year":"1978","unstructured":"P.G.Hinman: Recursion Theoretic Hierarchies, Springer, Berlin 1978"},{"key":"26_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E.Hopcroft, J.D.Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, Mass. 1979"},{"issue":"no.2","key":"26_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G.S. Makanin","year":"1977","unstructured":"G.S.Makanin: The Problem of Solvability of Equations in a Free Semigroup, Math. USSR-Sb. 32, no. 2 (1977), pp. 129\u2013198","journal-title":"Math. USSR-Sb."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2268308","volume":"11","author":"W.V. Quine","year":"1946","unstructured":"W.V.Quine: Concatenation as a Basis for Arithmetic, J. Symbolic Logic 11 (1946), pp. 105\u2013114","journal-title":"J. Symbolic Logic"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"M.O.Rabin, D.Scott: Finite Automata and Their Decision Problems, IBM J. Res. Develop. 3 (1959), pp. 114\u2013125 (reprinted in: Sequential Machines: Selected Papers, (E.Moore, Ed.), Addison-Wesley, Reading, Mass. 1965, pp. 63\u201391)","journal-title":"IBM J. Res. Develop."},{"key":"26_CR11","unstructured":"S. Seibert: Quantifier Hierarchies over Word Relations, Bericht 9204, Institut f. Informatik u. Prakt. Math., Univ. Kiel 1992"},{"key":"26_CR12","unstructured":"S.Senger: The Existential Theory of Concatenation, Ph. D. Dissertation, Purdue University 1982"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"R.M.Smullyan: Theory of Formal Systems, Princeton University Press 1961","DOI":"10.1515\/9781400882007"},{"key":"26_CR14","series-title":"Lect. Notes in Comp. Sci. 386","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/BFb0013115","volume-title":"Formal Properties of Finite Automata and Applications","author":"W. Thomas","year":"1989","unstructured":"W.Thomas: Automata and Quantifier Hierarchies, in: Formal Properties of Finite Automata and Applications (J.E.Pin, ed.), Lect. Notes in Comp. Sci. 386, Springer, Berlin 1989, pp. 104\u2013119"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023779.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:36Z","timestamp":1607550636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023779","relation":{},"subject":[]}}