{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:22:27Z","timestamp":1648866147533},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1972,9,1]],"date-time":"1972-09-01T00:00:00Z","timestamp":84153600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1972,9]]},"DOI":"10.1007\/bf01740725","type":"journal-article","created":{"date-parts":[[2005,6,13]],"date-time":"2005-06-13T21:31:36Z","timestamp":1118698296000},"page":"334-342","source":"Crossref","is-referenced-by-count":2,"title":["Some results in tree automata"],"prefix":"10.1007","volume":"6","author":[{"given":"L. S.","family":"Levy","sequence":"first","affiliation":[]},{"given":"A. K.","family":"Joshi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01740725_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W. C. Rounds","year":"1970","unstructured":"W. C. Rounds, Mappings and grammars on trees,Math. Systems Theory 4 (1970), 257\u2013287.","journal-title":"Math. Systems Theory"},{"key":"BF01740725_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory,J. Comput. Systems Sci. 1 (1967), 317\u2013322.","journal-title":"J. Comput. Systems Sci."},{"key":"BF01740725_CR3","doi-asserted-by":"crossref","unstructured":"D. F. Martin andS. A. Vere, On syntax-directed transduction and tree transducers,Second Annual Symposium on Theory of Computing, 1970, pp. 129\u2013135.","DOI":"10.1145\/800161.805158"},{"key":"BF01740725_CR4","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BF01740724","volume":"6","author":"P. S. Peters","year":"1972","unstructured":"P. S. Peters andR. W. Ritchie, Context-sensitive immediate constituent analysis: Context-free languages revisited,Math. Systems Theory 6 (1972), 324\u2013333.","journal-title":"Math. Systems Theory"},{"key":"BF01740725_CR5","doi-asserted-by":"crossref","unstructured":"W. C. Rounds, Tree-oriented proofs of some theorems on context-free and indexed languages, Second Annual ACM Symposium on Theory of Computing, 1970, pp. 109\u2013116.","DOI":"10.1145\/800161.805156"},{"key":"BF01740725_CR6","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J. W. Thatcher","year":"1968","unstructured":"J. W. Thatcher andJ. B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic,Math. Systems Theory 2 (1968), 57\u201381.","journal-title":"Math. Systems Theory"},{"key":"BF01740725_CR7","doi-asserted-by":"crossref","unstructured":"A. V. Aho andJ. D. Ullman, Translations on a context-free grammar, 1969 ACM Symposium on Theory of Computing, pp. 93\u2013112.","DOI":"10.1145\/800169.805425"},{"key":"BF01740725_CR8","unstructured":"J. W. Thatcher, There's a lot more to finite automata theory than you would have thought, Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 263\u2013276."},{"key":"BF01740725_CR9","unstructured":"L. S. Levy, Generalized local adjunction and replacement in adjunct languages, Moore School Report No. 70-29, 1970."},{"key":"BF01740725_CR10","volume-title":"Formal Languages and Their Relations to Automata","author":"J. E. Hopcroft","year":"1969","unstructured":"J. E. Hopcroft andJ. D. Ullman,Formal Languages and Their Relations to Automata, Addison Wesley, Reading, Mass., 1969."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01740725.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01740725\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01740725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T18:18:11Z","timestamp":1586283491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01740725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1972,9]]}},"alternative-id":["BF01740725"],"URL":"https:\/\/doi.org\/10.1007\/bf01740725","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,9]]}}}