{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:00:45Z","timestamp":1768273245536,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":14078,"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":[[1975,1]]},"DOI":"10.1016\/s0019-9958(75)90058-3","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"1-36","source":"Crossref","is-referenced-by-count":46,"title":["Generalizations of regular sets and their application to a study of context-free languages"],"prefix":"10.1016","volume":"27","author":[{"given":"Masako","family":"Takahashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(75)90058-3_bib1","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","article-title":"Minimization of tree automata","volume":"13","author":"Brainerd","year":"1968","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular canonical systems","volume":"6","author":"B\u00fcchi","year":"1964","journal-title":"Archiv. Math. Loqik Grundlagenforsch"},{"key":"10.1016\/S0019-9958(75)90058-3_bib4","series-title":"Computer Programming and Formal Systems","article-title":"The algebraic theory of context-free languages","author":"Chomsky","year":"1963"},{"key":"10.1016\/S0019-9958(75)90058-3_bib5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0019-9958(75)90058-3_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(67)80003-5","article-title":"Bracketed context-free languages","volume":"1","author":"Ginsburg","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(75)90058-3_bib7","series-title":"Proceedings of a conference at Univ. of Western Ontario","article-title":"Explicit Definitions and Linguistic Dominoes","author":"Gorn","year":"1966"},{"key":"10.1016\/S0019-9958(75)90058-3_bib8","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(75)90058-3_bib9_1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0019-9958(72)90051-4","article-title":"String adjunct grammars","volume":"21","author":"Joshi","year":"1972","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib9_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0019-9958(72)80005-6","article-title":"String adjunct grammars","volume":"21","author":"Joshi","year":"1972","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0019-9958(67)90564-5","article-title":"A characterization of parenthesis languages","volume":"11","author":"Knuth","year":"1967","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib11","series-title":"The Art of Computer Programming","author":"Knuth","year":"1968"},{"key":"10.1016\/S0019-9958(75)90058-3_bib12","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","article-title":"Parenthesis grammars","volume":"14","author":"McNaughton","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(75)90058-3_bib13","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0019-9958(75)90058-3_bib14","series-title":"Sequential Machines-Selected Papers","article-title":"On the class of events representable in a finite automaton","author":"Medvedev","year":"1964"},{"key":"10.1016\/S0019-9958(75)90058-3_bib15","article-title":"Finite automata and the representation of events","volume":"57\u2013624","author":"Myhill","year":"1957","journal-title":"Wright Air Develop. Command Tech. Rept."},{"key":"10.1016\/S0019-9958(75)90058-3_bib16","first-page":"541","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/S0019-9958(75)90058-3_bib17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0019-9958(68)90999-6","article-title":"D\u00e9finition et \u00e9tude des bilangages r\u00e9guliers","volume":"13","author":"Pair","year":"1968","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(75)90058-3_bib18","series-title":"Proceeding of IRIA Symposium on Theory of Automata, Languages, and Programming","article-title":"Primitive Transformations of Regular Sets and Recognizable Sets","author":"Takahashi","year":"1972"},{"key":"10.1016\/S0019-9958(75)90058-3_bib19","article-title":"Regular Sets of Strings, Trees and W-Structures","author":"Takahashi","year":"1972"},{"key":"10.1016\/S0019-9958(75)90058-3_bib20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(75)90058-3_bib21","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machines","volume":"4","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875900583?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995875900583?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:24:30Z","timestamp":1548926670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995875900583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1975,1]]}},"alternative-id":["S0019995875900583"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(75)90058-3","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1975,1]]}}}