{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:39:27Z","timestamp":1648813167351},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf01699459","type":"journal-article","created":{"date-parts":[[2005,5,15]],"date-time":"2005-05-15T07:15:04Z","timestamp":1116141304000},"page":"19-32","source":"Crossref","is-referenced-by-count":3,"title":["On the usefulness of bifaithful rational cones"],"prefix":"10.1007","volume":"18","author":[{"given":"Michel","family":"Latteux","sequence":"first","affiliation":[]},{"given":"Jeannine","family":"Leguy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01699459_CR1","unstructured":"J. M. Autebert, Cylindres de langages al\u00e9briques. Th\u00e8se Sc. Math. Paris, 1978."},{"key":"BF01699459_CR2","first-page":"45","volume-title":"Fundamentals of Computation Theory","author":"J. Beauquier","year":"1979","unstructured":"J. Beauquier, Independence of linear and one-counter generators.Fundamentals of Computation Theory, Akademie. Verlag, Berlin 1979, 45\u201351."},{"key":"BF01699459_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0019-9958(81)90456-3","volume":"49","author":"J. Beauquier","year":"1981","unstructured":"J. Beauquier and J. Berstel, More about the \u201cGeography\u201d of context free languages.Information and Control 49, 1981, 91\u2013108.","journal-title":"Information and Control"},{"key":"BF01699459_CR4","doi-asserted-by":"crossref","unstructured":"J. Berstel,Transductions and Context-Free Languages, Teubner Verlag, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"BF01699459_CR5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0022-0000(73)80036-4","volume":"7","author":"L. Boasson","year":"1973","unstructured":"L. Boasson, Two iteration theorems for some families of languages,J. of Comput. and Syst. Sciences 7, 1973, 583\u2013596.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(74)90050-7","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. Boasson, The inclusion of the substitution closure of linear and one-counter languages in the Largest sub AFL of the family of CFL's is proper,Inform. Process. Let 2, 1973, 135\u2013140.","journal-title":"Inform. Process. Let"},{"key":"BF01699459_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1051\/ita\/1979130302031","volume":"13","author":"L. Boasson","year":"1979","unstructured":"L. Boasson, Un langage alg\u00e9brique particulier,Rairo Informatique Theorique 13, 1979, 203\u2013215.","journal-title":"Rairo Informatique Theorique"},{"key":"BF01699459_CR8","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"L. Boasson and M. Nivat, Sur diverses familles de langages ferm\u00e9es par transduction rationnelle.Acta Informatica 2, 1973, 180\u2013188.","journal-title":"Acta Informatica"},{"key":"BF01699459_CR9","unstructured":"S. Eilenberg, Communication au Congr\u00e8s International des math\u00e9maticiens, Nice, 1970."},{"key":"BF01699459_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(81)90198-4","volume":"50","author":"J. Engelfriet","year":"1981","unstructured":"J. Engelfriet, and G. Rozenberg, A translational theorem for the class of EOL languages.Information and Control 1981, 50, 175\u2013183.","journal-title":"Information and Control"},{"key":"BF01699459_CR11","unstructured":"S. Ginsburg,Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland Publishing Company, 1975."},{"key":"BF01699459_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0022-0000(75)80038-9","volume":"10","author":"S. Ginsburg","year":"1975","unstructured":"S. Ginsburg, J. Goldstine, and S. Greibach, Uniformly erasable AFL,J. of Comput. and Syst. Sciences 10, 1975, 165\u2013182.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR13","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"S. Ginsburg and S. Greibach, Abstract families of languages. Memoirs of the American Mathematical Society 87, 1969, 1\u201332.","journal-title":"Memoirs of the American Mathematical Society"},{"key":"BF01699459_CR14","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. of Comput. and Syst. Sciences 6, 1972, 9\u201329.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01691106","volume":"4","author":"S. Greibach","year":"1970","unstructured":"S. Greibach, Chains of full AFL's,Math. Syst. Theory 4, 1970, 231\u2013242.","journal-title":"Math. Syst. Theory"},{"key":"BF01699459_CR16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0022-0000(72)80039-4","volume":"6","author":"S. Greibach","year":"1972","unstructured":"S. Greibach, Simple syntactic operators on full semi-AFL's,J. of Comput. and Syst. Sciences 6, 1972, 30\u201376.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","volume":"10","author":"S. Greibach","year":"1975","unstructured":"S. Greibach, One counter languages and the IRS condition,J. of Comput. and Syst. Sciences 10 (1975), 237\u2013247.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","volume":"18","author":"M. Latteux","year":"1979","unstructured":"M. Latteux, C\u00f4nes rationnels commutatifs,J. of Comput. and Syst. Sciences 18, 1979, 307\u2013333.","journal-title":"J. of Comput. and Syst. Sciences"},{"key":"BF01699459_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00288769","volume":"13","author":"M. Latteux","year":"1980","unstructured":"M. Latteux, Sur les g\u00e9n\u00e9rateurs alg\u00e9briques et lin\u00e9aires,Acta Informatica 13, 1980, 347\u2013363.","journal-title":"Acta Informatica"},{"key":"BF01699459_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0304-3975(81)90020-7","volume":"14","author":"M. Latteux","year":"1981","unstructured":"M. Latteux, A propos du lemme de substitution,Theoretical Computer Science 14, 1981, 119\u2013123.","journal-title":"Theoretical Computer Science"},{"key":"BF01699459_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0017296","volume":"104","author":"M. Latteux","year":"1981","unstructured":"M. Latteux, Quelques propri\u00e9t\u00e9 des langages \u00e0 un compteur. in 5\u00e8me GI-Conference, Lecture Notes inComputer Science 104, 1981, 52\u201363.","journal-title":"Lecture Notes in Computer Science"},{"key":"BF01699459_CR22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00625281","volume":"18","author":"J. Leguy","year":"1982","unstructured":"J. Leguy, Langages satur\u00e9s et c\u00f4nes d\u00e9croissants. Langages et c\u00f4nes bifid\u00e8les,Acta Informatica 18, 1982, 65\u201378.","journal-title":"Acta Informatica"},{"key":"BF01699459_CR23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1051\/ita\/1981150201411","volume":"5","author":"J. Leguy","year":"1981","unstructured":"J. Leguy, Transductions rationnelles d\u00e9croissantes,Rairo Informatique Theorique 5, 1981, 141\u2013148.","journal-title":"Rairo Informatique Theorique"},{"key":"BF01699459_CR24","unstructured":"J. Leguy, Deux nouvelles extensions du lemme de substitution. in Actes du Colloque: Mathematics for Computer Science, Paris, 16\u201318 Mars 1982, 199\u2013204."},{"key":"BF01699459_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"M. Nivat, Transductions des langages de Chomsky,Ann. Inst. Fourier 18, 1968, 339\u2013455.","journal-title":"Ann. Inst. Fourier"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01699459.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01699459\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01699459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T20:09:19Z","timestamp":1557259759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01699459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF01699459"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01699459","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}
