{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:12:08Z","timestamp":1704154328808},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(97)00035-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T04:26:12Z","timestamp":1049516772000},"page":"61-83","source":"Crossref","is-referenced-by-count":11,"title":["On representing recursively enumerable languages by internal contextual languages"],"prefix":"10.1016","volume":"205","author":[{"given":"Andrzej","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"P\u2191n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00035-2_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB2","article-title":"Cancellations in linear context-free languages","author":"Brandenburg","year":"1989","journal-title":"Univ. Passau, Fakult\u00e4t f\u00fcr Math, und Informatik, Report MIP-8904"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB3","series-title":"7th Conf. on Automata and Formal Languages","article-title":"On context-free grammars with regular control sets","author":"Brandenburg","year":"1993"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB4","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","year":"1989"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s002360050059","article-title":"The linear landscape of external contextual languages","volume":"33","author":"Ehrenfeucht","year":"1996","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00263503","article-title":"Scattered versus context-sensitive rewriting","volume":"27","author":"Gonczarowski","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB7","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB8","first-page":"287","article-title":"Contextual grammars with regulated selection","volume":"30","author":"Istrail","year":"1978","journal-title":"Stud. Cercet. Mat."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB9","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF00267045","article-title":"The family of one-counter languages is closed under quotient","volume":"22","author":"Latteux","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01237236","article-title":"A characterization of recursively enumerable languages","volume":"28","author":"Latteux","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB11","series-title":"Algebraic Linguistics. Analytical Models","author":"Marcus","year":"1967"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB12","first-page":"1525","article-title":"Contextual grammars","volume":"14","author":"Marcus","year":"1969","journal-title":"Rev. Roum. Math. Pures Appl."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB13","first-page":"103","volume":"42","author":"Maurer","year":"1979","journal-title":"Pure grammars, Inform, and Control"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB14","series-title":"Contextual Grammars","author":"P\u0103un","year":"1982"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB15","first-page":"218","article-title":"A characterization of recursively enumerable languages","volume":"45","author":"P\u0103un","year":"1991","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB16","first-page":"263","article-title":"Marcus contextual grammars. After 25 years","volume":"52","author":"P\u0103un","year":"1994","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB17","first-page":"641","article-title":"On the inner contextual grammars","volume":"25","author":"P\u0103un","year":"1980","journal-title":"Rev. Roum. Math. Pures Appl."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB18","series-title":"Developments in Language Theory","first-page":"370","article-title":"Contextual grammars: erasing, determinism, one-sided contexts","author":"P\u0103un","year":"1994"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.3233\/FI-1996-253410","article-title":"Contextual grammars: parallelism and blocking of derivations","volume":"25","author":"P\u0103un","year":"1996","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB20","series-title":"Mathematical Aspects of Natural and Formal Languages","first-page":"375","article-title":"Marcus contextual grammars: modularity and leftmost derivation","author":"P\u0103un","year":"1994"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","article-title":"Programmed grammars and classes of formal languages","volume":"16","author":"Rosenkrantz","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB22","article-title":"On some families of formal languages obtained by regulated derivations","volume":"179","author":"Salomaa","year":"1970","journal-title":"Ann. Acad. Sci. Fennicae, Ser. A, Math."},{"key":"10.1016\/S0304-3975(97)00035-2_BIB23","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB24","first-page":"145","article-title":"On characterization of recursively enumerable languages in terms of linear languages and VW-grammars","volume":"81","author":"Turakainen","year":"1978"},{"key":"10.1016\/S0304-3975(97)00035-2_BIB25","first-page":"167","article-title":"Two theorems about Marcus contextual languages","volume":"35","author":"Vicolov","year":"1991","journal-title":"Bull. Math. Soc. Sci. Math. Roumanie"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T23:41:50Z","timestamp":1704152510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397597000352"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00035-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}