{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:39:32Z","timestamp":1768289972218,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540167838","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016286","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"594-601","source":"Crossref","is-referenced-by-count":2,"title":["The centers of context-sensitive languages"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Nehrlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Alt H. and K. Mehlhorn, A language over a one symbol alphabet requiring only O(log log n) space, SIGACT News, Vol. 7 (1975).","DOI":"10.1145\/990502.990506"},{"key":"57_CR2","first-page":"28","volume-title":"Topological characterizations of infinite behaviours of transition systems","author":"A. Arnold","year":"1983","unstructured":"Arnold A., Topological characterizations of infinite behaviours of transition systems, Proc. 10th ICALP, In: LNCS 154, Springer-Verlag, Berlin 1983, 28\u201338."},{"key":"57_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0017316","volume-title":"Theoretical Computer Sci.","author":"L. Boasson","year":"1981","unstructured":"Boasson L. and M. Nivat, Centers of languages, in: Theoretical Computer Sci. (P. Deussen ed.), LNCS 104, Springer-Verlag, Berlin 1981, 245\u2013251."},{"key":"57_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(78)90002-6","volume":"6","author":"R.S. Cohen","year":"1978","unstructured":"Cohen R.S. and A.Y. Gold, \u03c9-computations on Turing machines, Theoret. Comput. Sci. 6 (1978), 1\u201323.","journal-title":"Theoret. Comput. Sci."},{"key":"57_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(78)90019-3","volume":"16","author":"R.S. Cohen","year":"1978","unstructured":"Cohen R.S. and A.Y. Gold, \u03c9-computations on deterministic push down machines, J. Comput. System Sci. 16 (1978), 275\u2013300.","journal-title":"J. Comput. System Sci."},{"key":"57_CR6","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0019-9958(76)90415-0","volume":"31","author":"M. Linna","year":"1976","unstructured":"Linna, M., On \u03c9-sets associated with context-free languages, Inform. Control 31 (1976), 272\u2013293.","journal-title":"Inform. Control"},{"key":"57_CR7","unstructured":"Nivat M., On the synchronisation of processes, Sem. d. Informatique Theor. du LITP, Ann. 1978\u201379, Univ. Paris 7."},{"key":"57_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","volume":"12","author":"M. Nivat","year":"1978","unstructured":"Nivat M., Sur les ensembles de mots infinis engendres par une grammaire algebrique, RAIRO Inf. Theor. 12 (1978), 259\u2013278.","journal-title":"RAIRO Inf. Theor."},{"key":"57_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(79)90042-2","volume":"8","author":"M. Prodinger","year":"1979","unstructured":"Prodinger M. and F. J. Urbanek, Language operators related to Init. Theoret. Comput. Sci. 8 (1979), 161\u2013165.","journal-title":"Theoret. Comput. Sci."},{"key":"57_CR10","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers H., Theory of Recursive Functions and Effective Computability, McGraw Hill, New York 1967."},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Stearns R.E., Hartmanis J. and P. M. Lewis, Hierarchies of memory limited computations, IEEE Conf. Rec. Switching Circuit Theory and Logic. Design, New York 1965, 179\u2013199.","DOI":"10.1109\/FOCS.1965.11"},{"key":"57_CR12","first-page":"219","volume":"22","author":"L. Staiger","year":"1986","unstructured":"Staiger L., Hierarchies of recursive \u03c9-languages, EIK \u2014 J. Inform. Proc. and Cybernetics 22 (1986), 219\u2013241.","journal-title":"EIK \u2014 J. Inform. Proc. and Cybernetics"},{"key":"57_CR13","unstructured":"Staiger L., \u03c9-computations on Turing machines and the accepted languages, in: Theory of Algorithms, L. Lov\u00e1sz and E. Szemer\u00e9di eds., Coll. Math. Soc. J\u00e1nos B\u00f3lyai No. 44, Budapest 1986, 393\u2013403."},{"key":"57_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/malq.19780243107","volume":"24","author":"L. Staiger","year":"1978","unstructured":"Staiger L. and K. Wagner, Rekursive Folgenmengen I. Z.Math. Logik Grundlag. Math. 24 (1978), 523\u2013538.","journal-title":"Z.Math. Logik Grundlag. Math."},{"key":"57_CR15","volume-title":"Computational Complexity","author":"K. Wagner","year":"1986","unstructured":"Wagner K. and G. Wechsung, Computational Complexity, Deutscher Verlag d. Wiss., Berlin 1986."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016286.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:36:03Z","timestamp":1607549763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0016286","relation":{},"subject":[]}}