{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:44:12Z","timestamp":1649209452904},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"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,3]]},"DOI":"10.1007\/bf01706092","type":"journal-article","created":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T09:20:54Z","timestamp":1119345654000},"page":"235-242","source":"Crossref","is-referenced-by-count":3,"title":["A model for ergodic automorphisms on groups"],"prefix":"10.1007","volume":"6","author":[{"given":"James R.","family":"Brown","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01706092_CR1","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0022-0000(70)80031-9","volume":"4","author":"R. V. Book","year":"1970","unstructured":"R. V. Book, S. A. Greibach andB. Wegbreit, Time and tape-bounded turing acceptors andAfl,J. Computer System Sciences 4 (1970), 606\u2013621.","journal-title":"J. Computer System Sciences"},{"key":"BF01706092_CR2","unstructured":"S. Ginsburg andJ. Goldstine, Intersection closed fullAfl and the recursively enumerable languages,Information and Control, to appear."},{"key":"BF01706092_CR3","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"S. Ginsburg andS. Greibach, Abstract families of languages,Memoirs Amer. Math. Soc. no. 87 (1969), pp. 1\u201332.","journal-title":"Memoirs Amer. Math. Soc."},{"key":"BF01706092_CR4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(70)80016-2","volume":"4","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andS. Greibach, PrincipalAfl,J. Computer System Sciences 4 (1970), 308\u2013338.","journal-title":"J. Computer System Sciences"},{"key":"BF01706092_CR5","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0019-9958(70)80035-3","volume":"17","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andM. Harrison, On the closure ofAfl under reversal,Information and Control 17 (1970), 395\u2013409.","journal-title":"Information and Control"},{"key":"BF01706092_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/BF01694178","volume":"5","author":"S. Ginsburg","year":"1971","unstructured":"S. Ginsburg andJ. Hopcroft, Images ofAfl under certain families of homomorphisms,Math. Systems Theory 5 (1971), 216\u2013227.","journal-title":"Math. Systems Theory"},{"key":"BF01706092_CR7","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0020-0255(70)90037-X","volume":"2","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andG. F. Rose, On the existence of generators for certainAfl,Information Sciences 2 (1970), 431\u2013446.","journal-title":"Information Sciences"},{"key":"BF01706092_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0020-0255(70)80044-5","volume":"2","author":"S. Ginsburg","year":"1970","unstructured":"S. Ginsburg andE. H. Spanier, Substitutions in families of languages,Information Sciences 2 (1970), 83\u2013110.","journal-title":"Information Sciences"},{"key":"BF01706092_CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0022-0000(72)80038-2","volume":"6","author":"J. Goldstine","year":"1972","unstructured":"J. Goldstine, Substitution and bounded languages,J. Computer System Sciences 6 (1972), 9\u201329.","journal-title":"J. Computer System Sciences"},{"key":"BF01706092_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","volume":"4","author":"S. Greibach","year":"1970","unstructured":"S. Greibach, Chains of fullAfl,Math. Systems Theory 4 (1970), 231\u2013242.","journal-title":"Math. Systems Theory"},{"key":"BF01706092_CR11","unstructured":"S. Greibach andS. Ginsburg, Multitapeafa,J. Assoc. Comput. Mach., to appear."},{"key":"BF01706092_CR12","doi-asserted-by":"crossref","unstructured":"David L. Lewis, Closure of families of languages under substitution operators,2nd Annual Symposium on Theory of Computing, Northhampton, Mass., 1970, pp. 100\u2013108.","DOI":"10.1145\/800161.805155"},{"key":"BF01706092_CR13","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/S0022-0000(71)80038-7","volume":"5","author":"J. S. Ullian","year":"1971","unstructured":"J. S. Ullian, Three theorems concerning principalAfl,J. Computer System Sciences 5 (1971), 304\u2013314.","journal-title":"J. Computer System Sciences"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706092.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01706092\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:32:17Z","timestamp":1557318737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01706092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01706092"],"URL":"https:\/\/doi.org\/10.1007\/bf01706092","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}