{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:51:50Z","timestamp":1768557110819,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1969,9,1]],"date-time":"1969-09-01T00:00:00Z","timestamp":-10540800000},"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":[[1969,9]]},"DOI":"10.1007\/bf01703920","type":"journal-article","created":{"date-parts":[[2005,6,12]],"date-time":"2005-06-12T07:35:07Z","timestamp":1118561707000},"page":"193-221","source":"Crossref","is-referenced-by-count":26,"title":["A general theory of translation"],"prefix":"10.1007","volume":"3","author":[{"given":"A. V.","family":"Aho","sequence":"first","affiliation":[]},{"given":"J. E.","family":"Hopcroft","sequence":"additional","affiliation":[]},{"given":"J. D.","family":"Ullman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01703920_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/366062.366083","volume":"4","author":"E. Irons","year":"1961","unstructured":"E. Irons, A syntax directed compiler forAlgol 60,Comm. ACM. 4 (1961), 51\u201355.","journal-title":"Comm. ACM."},{"key":"BF01703920_CR2","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. V. Aho","year":"1968","unstructured":"A. V. Aho, Indexed grammars\u2014An extension of context free grammars,J. Assoc. Comput. Mach. 15 (1968), 647\u2013671.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. J. Rosenkrantz","year":"1969","unstructured":"D. J. Rosenkrantz, Programmed grammars and classes of formal languages,J. Assoc. Comput. Mach. 16 (1969), 107\u2013131.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1145\/368834.368898","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"R. W. Floyd, On the nonexistence of a phrase structure grammar forAlgol 60,Comm. ACM. 5 (1962), 483\u2013484.","journal-title":"Comm. ACM."},{"key":"BF01703920_CR5","first-page":"464","volume":"15","author":"P. M. Lewis II","year":"1968","unstructured":"P. M. Lewis II andR. E. Stearns, Syntax Directed Transduction,J. Assoc. Comput. Mach. 15 (1968), 464\u2013488.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR6","first-page":"76","volume-title":"Well-translatable languages andAlgol-like languages, IFIP Working Conference onFormal Language Description Languages","author":"K. Culik","year":"1966","unstructured":"K. Culik, Well-translatable languages andAlgol-like languages, IFIP Working Conference onFormal Language Description Languages pp. 76\u201385, N. Holland Press, Amsterdam, 1966."},{"key":"BF01703920_CR7","unstructured":"M. Paull, \u201cBilateral Descriptions of Syntactic Mappings\u201d,First Annual Princeton Conference on Information Sciences and Systems, 1967."},{"key":"BF01703920_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TEC.1962.5219345","volume":"EC-11","author":"S. Ginsburg","year":"1962","unstructured":"S. Ginsburg, Examples of abstract machines,IRE Trans. EC-11 (1962), 132\u2013135.","journal-title":"IRE Trans."},{"key":"BF01703920_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C. C. Elgot","year":"1965","unstructured":"C. C. Elgot andJ. E. Mezei, On relations defined by generalized finite automata,IBM J. Res. Develop. 9 (1965), 47\u201368.","journal-title":"IBM J. Res. Develop."},{"key":"BF01703920_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321160.321167","volume":"10","author":"S. Ginsburg","year":"1963","unstructured":"S. Ginsburg andG. Rose, Operations which preserve definability in languages,J. Assoc. Comput. Mach. 10 (1963), 175\u2013195.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.4153\/CJM-1966-040-3","volume":"18","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg andG. Rose, A characterization of machine mappings,Canad. J. Math. 18 (1966), 381\u2013388:","journal-title":"Canad. J. Math."},{"key":"BF01703920_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0019-9958(66)80011-6","volume":"9","author":"J. N. Gray","year":"1966","unstructured":"J. N. Gray andM. A. Harrison, The theory of sequential relations,Information and Control,9 (1966), 435\u2013468.","journal-title":"Information and Control"},{"key":"BF01703920_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0019-9958(66)90211-7","volume":"9","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg andG. Rose, Preservation of languages by transducers,Information and Control,9 (1966), 153\u2013176.","journal-title":"Information and Control"},{"key":"BF01703920_CR14","doi-asserted-by":"crossref","unstructured":"S. Ginsburg andS. A. Greibach, Abstract families of languages,IEEE Conference Record of 1967 8th Annual Symposium on Switching and Automata Theory, pp. 128\u2013139.","DOI":"10.1109\/FOCS.1967.3"},{"key":"BF01703920_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114\u2013125.","journal-title":"IBM J. Res. Develop."},{"key":"BF01703920_CR16","doi-asserted-by":"crossref","unstructured":"A. L. Rosenberg, Onn-tape Finite State Acceptors,IEEE Conference Record of 5th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 76\u201381, 1964.","DOI":"10.1109\/SWCT.1964.17"},{"key":"BF01703920_CR17","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1002\/j.1538-7305.1967.tb03172.x","volume":"46","author":"J. E. Hopcroft","year":"1967","unstructured":"J. E. Hopcroft andJ. D. Ullman, An approach to a unified theory of automata,Bell System Tech. J. 46 (1967), 1793\u20131829.","journal-title":"Bell System Tech. J."},{"key":"BF01703920_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321450.321463","volume":"15","author":"J. E. Hopcroft","year":"1968","unstructured":"J. E. Hopcroft andJ. D. Ullman, Decidable and undecidable questions about automata,J. Assoc. Comput. Mach. 15 (1968), 317\u2013324.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR19","first-page":"140","volume":"Oct.","author":"J. E. Hopcroft","year":"1967","unstructured":"J. E. Hopcroft andJ. D. Ullman, \u201cAn Approach to a Unified Theory of Automata\u201d (extended abstract),IEEE Conference Record of 1967 8th Annual Symposium on Switching and Automata Theory, Oct. 1967, 140\u2013147.","journal-title":"IEEE Conference Record of 1967 8th Annual Symposium on Switching and Automata Theory"},{"key":"BF01703920_CR20","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S. Ginsburg","year":"1967","unstructured":"S. Ginsburg, S. A. Greibach andM. A. Harrison, Stack automata and compiling,J. Assoc. Comput. Mach. 14 (1967), 172\u2013201.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01703920_CR21","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, N.Y., 1966."},{"key":"BF01703920_CR22","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","volume":"11","author":"J. N. Gray","year":"1967","unstructured":"J. N. Gray, M. A. Harrison andO. Ibarra, Two-way pushdown automata,Information and Control 11 (1967), 30\u201370.","journal-title":"Information and Control"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01703920.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01703920\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01703920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T17:37:13Z","timestamp":1586281033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01703920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,9]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1969,9]]}},"alternative-id":["BF01703920"],"URL":"https:\/\/doi.org\/10.1007\/bf01703920","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1969,9]]}}}