{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:43Z","timestamp":1725663163955},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540081388"},{"type":"electronic","value":"9783540373896"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08138-0_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:17:06Z","timestamp":1330168626000},"page":"145-148","source":"Crossref","is-referenced-by-count":1,"title":["Un langage algebrique non-generateur"],"prefix":"10.1007","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,23]]},"reference":[{"key":"12_CR1","unstructured":"Beauquier, J.: G\u00e9n\u00e9rateurs Alg\u00e9briques Non-Ambigus. In: Automata, Languages and Programming. 3rd Colloquium. Edimbourg (1976), p. 66\u201373"},{"key":"12_CR2","unstructured":"Boasson, L.: An Iteration Theorem for One-Counter Languages. 3rd Annual ACM Symposium on Theory of Computing (1970), p. 116\u2013120"},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0020-0190(74)90050-7","volume":"2","author":"L. Boasson","year":"1973","unstructured":"Boasson, L.: 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. Information Processing Letters, 2, No. 5 (1973), p. 135\u2013140","journal-title":"Information Processing Letters"},{"key":"12_CR4","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"Boasson, L., Nivat, M.: Sur Diverses Familles de Languages Ferm\u00e9es par transduction Rationnelle. Acta Informatica 2 (1973), p. 180\u2013188","journal-title":"Acta Informatica"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boasson, L., Nivat, M.: Parenthesis Generators. 17th Annual Symposium on Foundations of Computer Sciences (SWAT) \u2014 Octobre 1976","DOI":"10.1109\/SFCS.1976.23"},{"key":"12_CR6","unstructured":"Ginsburg, S.: The Mathematical Theory of CFL's. McGraw-Hill (1966)"},{"key":"12_CR7","unstructured":"Ginsburg, S.: Algebraic and Automata Theoretic Properties of Formal Languages. North-Holland (1975)"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01691106","volume":"4","author":"S. Greibach","year":"1970","unstructured":"Greibach, S.: Chains of Full AFL's. Math. System Theory 4, No. 3 (1970), p. 231\u2013242","journal-title":"Math. System Theory"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(75)80042-0","volume":"10","author":"S. Greibach","year":"1975","unstructured":"Greibach, S.: One-Counter Languages and the IRS Condition. J. of Computer and System Sciences 10 (1975), p. 237\u2013247","journal-title":"J. of Computer and System Sciences"},{"key":"12_CR10","unstructured":"Hopcroft, J.E., Korenjack, A.J.: Simple Deterministic Languages. 7th IEEE Symposium on Swisthing and Automata Theory (1966), p. 36\u201346"},{"key":"12_CR11","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. Anales de l'Institut Fourier 18 (1968), p. 339\u2013456","journal-title":"Anales de l'Institut Fourier"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01694004","volume":"2","author":"W. Ogden","year":"1967","unstructured":"Ogden, W.: A Helpful Result for Proving Inherent Ambiguity. Math. System Theory 2 (1967), p. 191\u2013194","journal-title":"Math. System Theory"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08138-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:51:16Z","timestamp":1619542276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08138-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540081388","9783540373896"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-08138-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}