{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:27:09Z","timestamp":1767893229401,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":17120,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1967,7]]},"DOI":"10.1016\/s0019-9958(67)90401-9","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T06:51:40Z","timestamp":1103093500000},"page":"80-101","source":"Crossref","is-referenced-by-count":19,"title":["Partial algorithm problems for context free languages"],"prefix":"10.1016","volume":"11","author":[{"given":"Joseph S.","family":"Ullian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(67)90401-9_bib1","series-title":"Language and Information","first-page":"116","article-title":"On formal properties of simple phrase structure grammars","author":"Bar-Hillel","year":"1964"},{"key":"10.1016\/S0019-9958(67)90401-9_bib2","series-title":"Computability and Unsolvability","author":"Davis","year":"1958"},{"key":"10.1016\/S0019-9958(67)90401-9_bib3","series-title":"Formal Language Description Languages for Computer Programming","first-page":"86","article-title":"A Survey of ALGOL-like and context-free language theory","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(67)90401-9_bib4","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"key":"10.1016\/S0019-9958(67)90401-9_bib5","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/S0019-9958(67)90401-9_bib6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1215\/ijm\/1256067893","article-title":"Sequences in context free languages","volume":"9","author":"Ginsburg","year":"1965","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0019-9958(67)90401-9_bib7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/321150.321153","article-title":"Some recursively unsolvable problems in ALGOL-like languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0019-9958(67)90401-9_bib8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321160.321167","article-title":"Operations which preserve definability in languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0019-9958(67)90401-9_bib9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.4153\/CJM-1966-040-3","article-title":"A characterization of machine mappings","volume":"18","author":"Ginsburg","year":"1966","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0019-9958(67)90401-9_bib10","first-page":"333","article-title":"Bounded ALGOL-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(67)90401-9_bib11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/321312.321318","article-title":"Ambiguity in context free languages","volume":"13","author":"Ginsburg","year":"1966","journal-title":"J. Assoc. Computing Machinery"},{"key":"10.1016\/S0019-9958(67)90401-9_bib12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","article-title":"A variant of a recursively unsolvable problem","volume":"52","author":"Post","year":"1946","journal-title":"Bull. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(67)90401-9_bib13","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0019-9958(67)90401-9_bib14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(62)90577-6","article-title":"A remark on discovery algorithms for grammars","volume":"5","author":"Shamir","year":"1962","journal-title":"Inform. Control"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867904019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995867904019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T18:41:46Z","timestamp":1586025706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995867904019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1967,7]]}},"alternative-id":["S0019995867904019"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(67)90401-9","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1967,7]]}}}