{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:16:50Z","timestamp":1649179010730},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90121-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["Generalized parenthesis languages and minimization of their parenthesis parts"],"prefix":"10.1016","volume":"31","author":[{"given":"Hideki","family":"Yamasaki","sequence":"first","affiliation":[]},{"given":"Masako","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90121-X_BIB1","article-title":"Contribution \u00e1 l'etude des propri\u00e9t\u00e9s arithm\u00e9tiques des langages formels","volume":"7","author":"Berstel","year":"1972"},{"key":"10.1016\/0304-3975(84)90121-X_BIB2","first-page":"49","article-title":"Canonical forms of context-free grammars and position restricted grammar forms","volume":"56","author":"Blatner","year":"1977"},{"key":"10.1016\/0304-3975(84)90121-X_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular canonical systems","volume":"6","author":"Buchi","year":"1964","journal-title":"Archiv. Math. Logik Glundlagenforsch"},{"key":"10.1016\/0304-3975(84)90121-X_BIB4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/322217.322224","article-title":"Superdeterministic PDAs: A subcase with a decidable problem","volume":"27","author":"Greibach","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90121-X_BIB5","article-title":"Graded languages\u2014a model for the description of derivation tree","volume":"93","author":"Kasai","year":"1971","journal-title":"RIMS"},{"key":"10.1016\/0304-3975(84)90121-X_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0019-9958(67)90564-5","article-title":"A characterization of parenthesis languages","volume":"11","author":"Knuth","year":"1967","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90121-X_BIB7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","article-title":"Parenthesis grammars","volume":"17","author":"McNaughton","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(84)90121-X_BIB8","series-title":"Res. Rept. Inf. Sci C-4","article-title":"Generalized parenthesis grammars and a description of Algol","author":"Takahashi","year":"1975"},{"key":"10.1016\/0304-3975(84)90121-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","article-title":"Generalizations of regular sets and their application to a study of context-free languages","volume":"27","author":"Takahashi","year":"1975","journal-title":"Inform. Control"},{"key":"10.1016\/0304-3975(84)90121-X_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(83)90106-8","article-title":"Net sets and relativised closure properties","volume":"22","author":"Takahashi","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(84)90121-X_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321864.321865","article-title":"Regularity and related problems for deterministic pushdown automaton","volume":"22","author":"Valiant","year":"1975","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490121X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758490121X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:08Z","timestamp":1555127468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758490121X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["030439758490121X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90121-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}