{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:31:00Z","timestamp":1777645860681,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[1996,4]]},"abstract":"<jats:p>In this paper we shall prove that is is undecidable whether the intersection of two k-limited 0L languages is empty, finite, regular, context-free or a k-limited language, whether the language generated by a context-free grammar is a k-limited 0L language or whether a klT0L language can be generated by a context-free grammar. Furthermore, it is undecidable whether the union of two k-limited 0L languages is such a language again.<\/jats:p>","DOI":"10.3233\/fi-1996-2613","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T20:48:42Z","timestamp":1575319722000},"page":"23-30","source":"Crossref","is-referenced-by-count":2,"title":["SOME UNDECIDABILITY RESULTS CONCERNING k-LIMITED 0L SYSTEMS"],"prefix":"10.1177","volume":"26","author":[{"given":"Heike","family":"Spilker","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, Postfach 3329, D-38023 Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietmar","family":"W\u00e4tjen","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, Postfach 3329, D-38023 Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1996,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1996-2613","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1996-2613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:32Z","timestamp":1777444412000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-1996-2613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["10.3233\/FI-1996-2613"],"URL":"https:\/\/doi.org\/10.3233\/fi-1996-2613","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,1,1]]}}}