{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T13:10:46Z","timestamp":1682773846673},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"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":[[1980,5]]},"DOI":"10.1007\/bf00288769","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T05:02:08Z","timestamp":1096952528000},"page":"347-363","source":"Crossref","is-referenced-by-count":11,"title":["Sur les g\ufffdn\ufffdrateurs alg\ufffdbriques et lin\ufffdaires","Algebraic and linear generators"],"prefix":"10.1007","volume":"13","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(79)90049-5","volume":"8","author":"A. Arnold","year":"1979","unstructured":"Arnold, A., Latteux, M.: A new proof of two theorems about rational transductions. Theor. Comput. Sci. 8, 261?263 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"CR2","unstructured":"Beauquier, J.: G\u00e9n\u00e9rateurs alg\u00e9briques non-ambigus. Automata, Languages and Programming. Third International Colloquium, S. Michaelson, R. Milner (eds.), pp. 66?73 (1976)"},{"key":"CR3","volume-title":"Th\u00e8se Sc. Math.","author":"J. Beauquier","year":"1977","unstructured":"Beauquier, J.: Contribution \u00e0 l'\u00e9tude de la complexit\u00e9 structurelle des langages alg\u00e9briques. Th\u00e8se Sc. Math. Universit\u00e9 de Paris VI, Paris 1977"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and context-free languages. Stuttgart: Teubner 1979"},{"key":"CR5","series-title":"Lecture Notes in Computer Science, vol. 67","first-page":"1","volume-title":"Theoretical Computer Science, 4th GI Conference","author":"L. Boasson","year":"1979","unstructured":"Boasson, L.: Context-free sets of infinite words. Theoretical Computer Science, 4th GI Conference. Lecture Notes in Computer Science, vol. 67, pp. 1?9. Berlin Heidelberg New York: Springer 1979"},{"key":"CR6","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"Boasson, L., Nivat, M: Sur diverses familles de langages ferm\u00e9es par transduction rationnelle. Acta Informat. 2, 180?188 (1973)","journal-title":"Acta Informat."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Boasson, L., Nivat, M.: Adherences of languages. J. Comput. System Sci. (1979 sous presse)","DOI":"10.1016\/0022-0000(80)90010-0"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1051\/ita\/1977110402731","volume":"11","author":"A. Ehrenfeucht","year":"1977","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On some context-free languages that are not deterministic ETOL languages. RAIRO Informatique th\u00e9orique 11, 273?291 (1977)","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(76)90076-1","volume":"1","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A., Rozenberg, G., Skyum, S.: A relationship between ETOL and EDTOL languages. Theor. Comput. Sci. 1, 325?330 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"CR10","volume-title":"Automata, languages and machines, Volume A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages and machines, Volume A. New York: Academic Press 1974"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Develop. 9, 47?68 (1965)","journal-title":"IBM J. Res. Develop."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Systems Theory 10, 289?303 (1977)","journal-title":"Math. Systems Theory"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree Transducers, L systems and two-way machines. Memorandum NR. 187, Twente University (1977)","DOI":"10.1145\/800133.804333"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(76)90086-7","volume":"4","author":"J. Engelfriet","year":"1976","unstructured":"Engelfriet, J., Skyum, S.: Copying theorems. Information Processing Lett. 4, 157?161 (1976)","journal-title":"Information Processing Lett."},{"key":"CR15","volume-title":"The mathematical theory of context-free languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The mathematical theory of context-free languages. New York: McGraw-Hill 1966"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0022-0000(75)80038-9","volume":"10","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S., Goldstine, J., Greibach, S.: Uniformly Erasable AFL. J. Comput. System Sci. 10, 165?182 (1975)","journal-title":"J. Comput. System Sci."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(78)90035-X","volume":"6","author":"S. Greibach","year":"1978","unstructured":"Greibach, S.: One-way finite visit automata. Theor. Comput. Sci. 6, 175?221 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0019-9958(79)90641-7","volume":"42","author":"M. Latteux","year":"1979","unstructured":"Latteux, M.: Substitutions dans les EDTOL-syst\u00e9mes ultralin\u00e9aires. Information and Control 42, 194?260 (1979)","journal-title":"Information and Control"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1051\/ita\/1977110100291","volume":"11","author":"M. Latteux","year":"1977","unstructured":"Latteux, M.: C\u00f4nes rationnels commutativement clos. RAIRO Informatique th\u00e9orique 11, 29?51 (1977)","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"CR20","unstructured":"Latteux, M.: EDTOL-syst\u00e8mes ultralin\u00e9aires et op\u00e9rateurs associ\u00e9s. Publication du laboratoire de Calcul de l'Universit\u00e9 de Lille I, 100 (1977)"},{"key":"CR21","unstructured":"Latteux, M.: G\u00e9n\u00e9rateurs alg\u00e9briques et langages EDTOL. Actes du ler Colloque AFCET-SMF de Math\u00e9matiques appliqu\u00e9es, tome II, 61?66 (1978)"},{"key":"CR22","unstructured":"Leguy, J.: Langages d'image finie et langages bifid\u00e8les. Publication n? IT-16-79, Lille 1979"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"Nivat, M.: Transduction des langages de Chomsky. Ann. Inst. Fourier 18, 339?455 (1968)","journal-title":"Ann. Inst. Fourier"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1051\/ita\/1978120302591","volume":"12","author":"M. Nivat","year":"1978","unstructured":"Nivat, M.: Sur les ensembles de mots infinis engendr\u00e9s par une grammaire alg\u00e9brique. RAIRO Informatique Th\u00e9orique 12, 259?278 (1978)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"CR25","unstructured":"Nivat, M.: en pr\u00e9paration"}],"container-title":["Acta Informatica"],"original-title":[],"language":"fr","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288769.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288769\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T12:44:04Z","timestamp":1682772244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["BF00288769"],"URL":"https:\/\/doi.org\/10.1007\/bf00288769","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}