{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:27Z","timestamp":1720201047148},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90095-2","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"201-228","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["On the active and full use of memory in right-boundary grammars and push-down automata"],"prefix":"10.1016","volume":"48","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.J.","family":"Hoogeboom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90095-2_BIB1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular canonical systems","volume":"6","author":"Buchi","year":"1964","journal-title":"Arch. Math. Logik Grundlag."},{"key":"10.1016\/0304-3975(86)90095-2_BIB2","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/0304-3975(86)90095-2_BIB3","article-title":"A note on regular canonical systems","author":"Ehrenfeucht","year":"1984"},{"key":"10.1016\/0304-3975(86)90095-2_BIB4","first-page":"455","article-title":"Computations in coordinated pair systems","volume":"IX","author":"Ehrenfeucht","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(86)90095-2_BIB5","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1051\/ita\/1986200404051","article-title":"Coordinated pair systems; Part 1: Dyck words and classical pumping","volume":"20","author":"Ehrenfeucht","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90095-2_BIB6","article-title":"On the active use of memory in right-boundary grammars and push-down automata","author":"Ehrenfeucht","year":"1985"},{"key":"10.1016\/0304-3975(86)90095-2_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(86)90095-2","article-title":"On the full use of memory in right-boundary grammars and push-down automata","author":"Ehrenfeucht","year":"1985"},{"key":"10.1016\/0304-3975(86)90095-2_BIB8","series-title":"Formal Language Theory. Perspectives and Open Problems","article-title":"Formal languages and their relation to automata: What Hopcroft and Ullman didn't tell us","author":"Goldstein","year":"1980"},{"key":"10.1016\/0304-3975(86)90095-2_BIB9","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(86)90095-2_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90086-6","article-title":"On coordinated selective substitutions: Towards a unified theory of grammars and machines","volume":"37","author":"Rozenberg","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90095-2_BIB11","series-title":"Theory of Automata","author":"Salomaa","year":"1969"},{"key":"10.1016\/0304-3975(86)90095-2_BIB12","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900952?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900952?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:54Z","timestamp":1553201634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":12,"alternative-id":["0304397586900952"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90095-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}