{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T05:51:41Z","timestamp":1649051501698},"reference-count":18,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1986]]},"DOI":"10.1051\/ita\/1986200100551","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:09:42Z","timestamp":1486048182000},"page":"55-77","source":"Crossref","is-referenced-by-count":1,"title":["Single-tape reset machines"],"prefix":"10.1051","volume":"20","author":[{"given":"S. A.","family":"Greibach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Wrathall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BLUM E. K., A Note on Free Subsemigroups with Two Generators, Bull. Amer. Math. Soc., Vol. 71, 1965, pp. 678-679.1770460131.02004","DOI":"10.1090\/S0002-9904-1965-11395-7"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BOASSON L. and NIVAT M., Sur diverses familles de langages ferm\u00e9s par transduction rationnelle, Acta Inf., Vol. 2, 1973, pp. 180-188.3318730242.68037","DOI":"10.1007\/BF00264030"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BOOK R., GREIBACH S. and WRATHALL C., Reset Machines, J. Comput. Syst. Sc., Vol 19, 1979, pp. 256-276.5566040427.03029","DOI":"10.1016\/0022-0000(79)90004-7"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. GINSBURG S. and SPANIER E. H., Bounded Regular Sets, Proc. Amer. Math. Soc., Vol. 17, 1966, pp. 1043-1049.2013100147.25301","DOI":"10.2307\/2036087"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. GINSBURG S. and SPANIER E. H., Bounded Algol-Like Languages, Trans. Amer. Math. Soc., Vol. 113, 1964, pp. 333-368.1815000142.24803","DOI":"10.2307\/1994067"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. GINSBURG S. and GREIBACH S., Principal AFL, J. Comput. Syst. Sc., Vol. 4, 1970, pp. 308-338.2865990198.03102","DOI":"10.1016\/S0022-0000(70)80016-2"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. GREIBACH S., Erasable Context-Free Languages, Inf. Control, Vol. 29, 1975, pp. 301-326.3863580317.68059","DOI":"10.1016\/S0019-9958(75)80002-7"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. GREIBACH S., Erasing in Context-Free AFLs, Inf. Control, Vol. 21, 1972, pp. 436-465.3318760248.68036","DOI":"10.1016\/S0019-9958(72)90133-7"},{"key":"R9","unstructured":"9. HULL R., Reset Languages, Ph. D. dissertation, University of California at Berkeley, 1979."},{"key":"R10","unstructured":"10. KLINGENSTEIN K., Structures of Bounded Languages in Certain Families of Languages, Ph. D. dissertation, University of California at Berkeley, 1975."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. LATTEUX M., C\u00f4nes rationnels commutativement clos, R.A.I..R.O.-Informatique th\u00e9orique, Vol. 11, 1977, pp. 29-51.920404787820354.68103","DOI":"10.1051\/ita\/1977110100291"},{"key":"R12","unstructured":"12. M. LOTHAIRE, ed., Combinatorics on Words, Addison-Wesley, Reading, Mass., 1982.6759530514.20045"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. SIROMONEY R., On Equal Matrix Languages, Inf. Control, Vol. 14, 1969, pp. 135-151.2538380169.31402","DOI":"10.1016\/S0019-9958(69)90050-3"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. GINSBURG S. and SPANIER E. H., AFL with the Semilinear Property, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 365-396.3395580235.68029","DOI":"10.1016\/S0022-0000(71)80024-7"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. SIROMONEY R., Finite-Turn Checking Automata, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 549-559.3665650231.68032","DOI":"10.1016\/S0022-0000(71)80015-6"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"16. IBARRA O., Simple Matrix Languages, Inf. Control, Vol. 17, 1970, pp. 359-394.2742320221.68041","DOI":"10.1016\/S0019-9958(70)80034-1"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. GINSBURG S. and GREIBACH S., On AFL Generators for Finitely Encoded AFA, J. Comput. Syst. Sc., Vol. 7, 1973, pp. 1-27.3270880249.68025","DOI":"10.1016\/S0022-0000(73)80047-9"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. BRANDENBURG F.-J., Multiple Equality Sets and Post Machines, J. Comput. Syst. Sc., Vol. 21, 1980, pp. 292-316.6035860452.68086","DOI":"10.1016\/0022-0000(80)90026-4"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200100551\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:59:24Z","timestamp":1568786364000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1986200100551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":18,"journal-issue":{"issue":"1"},"alternative-id":["ita1986200100551"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1986200100551","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}