{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:02:48Z","timestamp":1648551768985},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1007\/bf00289160","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:22:28Z","timestamp":1096946548000},"page":"749-769","source":"Crossref","is-referenced-by-count":9,"title":["Iterated GSMs and Co-CFL"],"prefix":"10.1007","volume":"26","author":[{"given":"Jean -Michel","family":"Autebert","sequence":"first","affiliation":[]},{"given":"Joaquim","family":"Gabarr\ufffd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/ita\/1979130403631","volume":"13","author":"J.-M. Autebert","year":"1979","unstructured":"Autebert, J.-M., B\u00e9auquier, J., Boasson, L., Nivat, M.: Quelques problemes ouverts en th\u00e9orie des langages alg\u00e9briques. RAIRO Inf. Theor. 13, 363?379 (1979)","journal-title":"RAIRO Inf. Theor."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-12-115350-2.50009-9","volume-title":"Formal Language Theory","author":"J.-M. Autebert","year":"1980","unstructured":"Autebert, J.-M., Beauquier, J., Boasson, L., Latteux, M.: Very small families of algebraic nonrational languages. In: Book, R.V. (ed.) Formal Language Theory, pp. 89?108. New York: Academic Press 1980"},{"key":"CR3","unstructured":"Autebert, J.-M., Gabarr\u00f3, J.: Compl\u00e9ments des facteurs gauches de mots infinis et ambiguit\u00e9: quelques exemples. Facultat d'Inform\u00e0tica de Barcelona, Report de Recerca RR85\/15, 1985"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0020-0190(87)90162-1","volume":"25","author":"J.-M. Autebert","year":"1987","unstructured":"Autebert, J.-M., Flajolet, P., Gabarro, J.: Prefixes of infinite words and ambiguous context-free languages. Inf. Process. Lett. 25, 211?216 (1987)","journal-title":"Inf. Process. Lett."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-12920-0_2","volume":"166","author":"J. Berstel","year":"1984","unstructured":"Berstel, J.: Some recent results on squarefree words, in STACS'84. Lect. Notes Comput. Sci. 166, 14?25 (1984)","journal-title":"Lect. Notes Comput. Sci."},{"key":"CR6","volume-title":"Compl\u00e9mentaires de mots infinis","author":"J. Berstel","year":"1986","unstructured":"Berstel, J.: Compl\u00e9mentaires de mots infinis. S\u00e9minaire du vendredi du LITP, Paris, December 1986"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(86)90034-7","volume":"22","author":"J. Berstel","year":"1986","unstructured":"Berstel, J.: Every iterated morphism yields a Co-CFL, Inf. Process. Lett. 22, 7?9 (1986)","journal-title":"Inf. Process. Lett."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1051\/ita\/1989230201951","volume":"23","author":"G. Blanc","year":"1989","unstructured":"Blanc, G., Bleuzen-Guernalec, N.: Production en temps r\u00e9el et complexit\u00e9 de structure de suites infinies. Theor. Inf. Appl. 23, 195?216 (1989) (To appear)","journal-title":"Theor. Inf. Appl."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(80)90010-0","volume":"20","author":"L. Boasson","year":"1980","unstructured":"Boasson, L., Nivat, M.: Adherences of languages. J. Comput. Syst. Sci. 20, 285?309 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR10","volume-title":"Automata, languages and machines, Vol. 1","author":"S. Eilenberg","year":"1987","unstructured":"Eilenberg, S.: Automata, languages and machines, Vol. 1. New York: Academic Press 1987"},{"key":"CR11","first-page":"186","volume":"67","author":"J. Goldstine","year":"1972","unstructured":"Goldstine, J.: Substitution and bounded languages. J. Comput. Syst. Sci. 67, 186?192 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(87)90098-6","volume":"24","author":"A. Grazon","year":"1987","unstructured":"Grazon, A.: An infinite word language which is not co-CFL. Inf. Process. Lett. 24, 81?85 (1987)","journal-title":"Inf. Process. Lett."},{"key":"CR13","first-page":"674","volume":"72","author":"W. Kolakovski","year":"1965","unstructured":"Kolakovski, W.: Self generating runs, problem 5304. Amer. Math. Monthly 72, 674 (1965). Solution of N. Ucoluk (same journal) 73, 681?682 (1966)","journal-title":"Amer. Math. Monthly"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(85)90073-0","volume":"20","author":"M.G. Main","year":"1985","unstructured":"Main, M.G.: An infinite square free Co-CFL. Inf. Process. Lett. 20, 105?107 (1985)","journal-title":"Inf. Process. Lett."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(87)90003-X","volume":"49","author":"M.G. Main","year":"1987","unstructured":"Main, M.G., Bucher, W., Haussler, D.: Applications of an infinite square free Co-CFL. Theor. Comput. Sci. 49, 113?119 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"CR16","volume-title":"Computation, finite and infinite machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation, finite and infinite machines. Englewood Cliffs, NJ: Prentice-Hall 1967"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Pansiot J.-J.: On various classes of infinite words. In: Nivat, M., Perrin, D. (eds.) Automata on Infinite Words. Lect. Notes Comput. Sci. 192, 188?197 (1984)","DOI":"10.1007\/3-540-15641-0_34"},{"key":"CR18","first-page":"434","volume":"20","author":"J.-J. Pansiot","year":"1986","unstructured":"Pansiot, J.-J.: Decidability of periodicity for infinite words. Theor. Inf. Appl. 20, 434?446 (1986)","journal-title":"Theor. Inf. Appl."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1051\/ita\/1987210201371","volume":"21","author":"A. Terlutte","year":"1987","unstructured":"Terlutte, A.: Sur le centre des langages DOL. Theor. Inf. Appl. 21, 137?145 (1987)","journal-title":"Theor. Inf. Appl."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(75)90013-4","volume":"1","author":"A. Reedy","year":"1975","unstructured":"Reedy, A., Savitch, W.J.: The Turing degree of inherent ambiguity problem for context-free languages. Theor Comput. Sci. 1, 77?91 (1975)","journal-title":"Theor Comput. Sci."},{"key":"CR21","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289160\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:42Z","timestamp":1554758082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["BF00289160"],"URL":"https:\/\/doi.org\/10.1007\/bf00289160","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}