{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:53Z","timestamp":1742617133263,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613770"},{"type":"electronic","value":"9783540685074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:40Z","timestamp":1330292140000},"page":"388-402","source":"Crossref","is-referenced-by-count":0,"title":["Bounded fixed-point definability and tabular recognition of languages"],"prefix":"10.1007","author":[{"given":"Hans","family":"Lei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114\u2013133, 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"23_CR2","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory, Springer, Berlin 1995."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985.","DOI":"10.1109\/SFCS.1985.27"},{"key":"23_CR4","volume-title":"Introduction to Formal Languages","author":"M. Harrison","year":"1978","unstructured":"M. Harrison. Introduction to Formal Languages. Addison Wesley, Reading 1978."},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(91)90205-G","volume":"80","author":"S. Heilbrunner","year":"1991","unstructured":"S. Heilbrunner and L. Schmitz. An efficient recognizer for the boolean closure of context-free languages. Theoretical Computer Science, 80:53\u201375, 1991.","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","first-page":"412","volume-title":"Lecture Notes in Computer Science 820","author":"G. Hotz","year":"1994","unstructured":"G. Hotz and G. Pitsch. Fast uniform analysis of coupled-context-free languages. In S. Abiteboul and E. Shamir, editors, 21st International Colloquium on Automata, Languages and Programming, pages 412\u2013423. Lecture Notes in Computer Science 820, Springer, Berlin 1994."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86\u2013104, 1986.","journal-title":"Information and Control"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science 933","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BFb0022257","volume-title":"Computer Science Logic '94","author":"C. Lautemann","year":"1995","unstructured":"C. Lautemann, T. Schwentick, and D. Th\u00e9rien. Logics for context-free languages. In Computer Science Logic '94, pages 205\u2013216. Lecture Notes in Computer Science 933, Springer, Berlin 1995."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science 626","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BFb0023771","volume-title":"Computer Science Logic '91","author":"H. Lei\u00df","year":"1992","unstructured":"H. Lei\u00df. Towards Kleene Algebra with Recursion. In E. B\u00f6rger e.a., editors, Computer Science Logic '91, pages 242\u2013256. Lecture Notes in Computer Science 626, Springer, Berlin 1992."},{"key":"23_CR10","unstructured":"C. Pollard. Generalized Phrase Structure Grammars, Head Grammars, and Natural Language. PhD thesis, Department of Linguistics, Stanford University, 1984."},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1075\/z.35.15roa","volume-title":"Mathematics of Language","author":"K. Roach","year":"1987","unstructured":"K. Roach. Formal properties of head grammars. In A. Manaster-Ramer, editor, Mathematics of Language, pages 293\u2013348. John Benjamins, Amsterdam 1987."},{"issue":"4","key":"23_CR12","first-page":"1","volume":"14","author":"W. Rounds","year":"1988","unstructured":"W. Rounds. A logic for linguistic descriptions and an analysis of its complexity. Computational Linguistics, 14(4):1\u20139, 1988.","journal-title":"Computational Linguistics"},{"issue":"2","key":"23_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"H. Seki, T. Matsumura, M. Fujii and T. Kasami. On multiple context-free grammars. Theoretical Computer Science, 88(2):191\u2013229, 1991.","journal-title":"Theoretical Computer Science"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"M. Vardi. Complexity of relational query languages. In 14th ACM Symposium on the Theory of Computing, pages 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"K. Vijay-Shanker and A. Joshi. Some computational properties of tree adjoining grammars. In Proceedigs of the 23rd Meeting of the Association for Computational Linguistics, pages 82\u201393, Chicago 1988.","DOI":"10.3115\/981210.981221"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:18:11Z","timestamp":1742599091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}