{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:30:10Z","timestamp":1775471410269,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1963,9,1]],"date-time":"1963-09-01T00:00:00Z","timestamp":-199929600000},"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":18519,"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":[[1963,9]]},"DOI":"10.1016\/s0019-9958(63)90306-1","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"246-264","source":"Crossref","is-referenced-by-count":141,"title":["On context-free languages and push-down automata"],"prefix":"10.1016","volume":"6","author":[{"given":"M.P.","family":"Sch\u00fctzenberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(63)90306-1_bib1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","article-title":"Finite state languages","volume":"1","author":"Chomsky","year":"1958","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(63)90306-1_bib2","article-title":"Context-free grammars and push-down storage","author":"Chomsky","year":"1962"},{"key":"10.1016\/S0019-9958(63)90306-1_bib3","series-title":"Computer Programming and Formal Systems","article-title":"The algebraic theory of context-free language","author":"Chomsky","year":"1962"},{"key":"10.1016\/S0019-9958(63)90306-1_bib4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to Algol","volume":"9","author":"Ginsburg","year":"1961","journal-title":"J. Assoc. Computing Mach."},{"key":"10.1016\/S0019-9958(63)90306-1_bib5","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1090\/S0002-9947-1959-0109367-6","article-title":"Symmetric random walks on groups","volume":"92","author":"Kesten","year":"1959","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(63)90306-1_bib6","series-title":"Proc. Western Joint Computer Conf.","first-page":"230","article-title":"Programming the logic theory machine","author":"Newell","year":"1957"},{"key":"10.1016\/S0019-9958(63)90306-1_bib7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Research Develop."},{"key":"10.1016\/S0019-9958(63)90306-1_bib8","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1090\/S0002-9947-1960-0114765-9","article-title":"Functional composition patterns and power-series reversion","volume":"94","author":"Raney","year":"1960","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0019-9958(63)90306-1_bib9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1515\/crll.1950.188.201","article-title":"Die Anwendung des Schiefen Produktes in der Gruppentheorie","volume":"188","author":"Redei","year":"1950","journal-title":"J. reine u. angew. Math."},{"key":"10.1016\/S0019-9958(63)90306-1_bib10","first-page":"657","article-title":"A property of a representation of a free group","volume":"57","author":"Sanov","year":"1947","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0019-9958(63)90306-1_bib11","series-title":"S\u00e9minaire Dubreil-Pisot","article-title":"Un probl\u00e8me de la th\u00e9orie des automates","author":"Sch\u00fctzenberger","year":"1959"},{"key":"10.1016\/S0019-9958(63)90306-1_bib12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.32.0198","article-title":"The reduction of two-way automata to one-way automata","volume":"3","author":"Shepherdson","year":"1959","journal-title":"IBM J. Research Develop."},{"key":"10.1016\/S0019-9958(63)90306-1_bib13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Sheperdson","year":"1963","journal-title":"J. Assoc. Computing Mach."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995863903061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995863903061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T22:19:04Z","timestamp":1682893144000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995863903061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1963,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1963,9]]}},"alternative-id":["S0019995863903061"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(63)90306-1","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1963,9]]}}}