{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:32Z","timestamp":1725662852127},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540088608"},{"type":"electronic","value":"9783540358077"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:35:49Z","timestamp":1330187749000},"page":"52-62","source":"Crossref","is-referenced-by-count":2,"title":["Ambiguite forte"],"prefix":"10.1007","author":[{"given":"Joffroy","family":"Beauquier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"5_CR1","first-page":"1203","volume":"282","author":"J. Beauquier","year":"1976","unstructured":"BEAUQUIER J. 1976. Une propri\u00e9t\u00e9 de non-ambigu\u00eft\u00e9 des g\u00e9n\u00e9rateurs alg\u00e9briques. C.R. Acad. Sc. Paris, t.282, p. 1203\u20131205.","journal-title":"C.R. Acad. Sc. Paris"},{"key":"5_CR2","unstructured":"BEAUQUIER J. 1977. Contribution \u00e0 l'\u00e9tude de la complexit\u00e9 structurelle des langages alg\u00e9briques. Th\u00e8se de Doctorat d'Etat. Universit\u00e9 Paris VII."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"BEAUQUIER J. 1978. Un g\u00e9n\u00e9rateur inh\u00e9remment ambigu du c\u00f4ne des langages alg\u00e9briques, \u00e0 para\u00eetre dans R.A.I.R.O. Theoretical Computer Science.","DOI":"10.1051\/ita\/1978120200991"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"BEAUQUIER J. 1978. G\u00e9n\u00e9rateurs alg\u00e9briques et syst\u00e8mes de paires it\u00e9rantes. A para\u00eetre dans Theoretical Computer Science.","DOI":"10.1016\/0304-3975(79)90015-X"},{"key":"5_CR5","unstructured":"BEAUQUIER J. 1978. Substitutions de langages lin\u00e9aires et \u00e0 compteur. Soumis au Journ. of Comput. and Syst. Sciences."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"BERSTEL J. 1978. Transductions and Context-Free Languages. Teubner Verlag.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"5_CR7","unstructured":"CRESTIN J.P. 1972. Sur un langage non-ambigu dont le carr\u00e9 est d'ambigu\u00eft\u00e9 inh\u00e9rente non-born\u00e9e. Actes du Colloque I.R.I.A."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0022-0000(72)80038-2","volume":"6","author":"J. Goldstine","year":"1972","unstructured":"GOLDSTINE J. 1972. Substitution and Bounded Languages,Journ. of Comput. and Syst. Sciences 6, p. 9\u201329.","journal-title":"Journ. of Comput. and Syst. Sciences"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF01691106","volume":"4","author":"S. Greibach","year":"1970","unstructured":"GREIBACH S. 1970. Chains of full AFL'S, Math. System Theory 4, p. 231\u2013242.","journal-title":"Math. System Theory"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"S. Greibach","year":"1973","unstructured":"GREIBACH S. 1973. The Hardest Context-Free Language, SIAM Journal of Computing 2, p. 304\u2013316.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR11","unstructured":"HAINES L.M. 1965. Generation and Recognition of Formal Languages, Doctoral Dissertation, M.I.T."},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"NIVAT M. 1968. Transductions des langages de Chomsky, Annales de l'Institut Fourier, 18, p. 339\u2013456.","journal-title":"Annales de l'Institut Fourier"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01694004","volume":"2","author":"W. Ogden","year":"1967","unstructured":"OGDEN W. 1967. A Helpful result for proving inherent ambiguity, Math. System Theory 2, p. 191\u2013194.","journal-title":"Math. System Theory"},{"key":"5_CR14","first-page":"570","volume":"13","author":"R. J. Parikh","year":"1966","unstructured":"PARIKH R.J. 1966. On Context-free Languages, J.A.C.M. 13, p. 570\u2013581.","journal-title":"J.A.C.M."},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0019-9958(71)90455-4","volume":"18","author":"E. Shamir","year":"1971","unstructured":"SHAMIR E. 1971. Some inherently ambiguous context-free languages, Information and Control 18, p. 355\u2013363.","journal-title":"Information and Control"},{"key":"5_CR16","unstructured":"SCH\u00dcTZENBERGER M.P. 1973. Sur un langage \u00e9quivalent au langage de Dyck, Logic, Methodology and Philosophy of Sciences IV, North Holland, p. 197\u2013203."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:09Z","timestamp":1605643209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1978]]}}}