{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:20Z","timestamp":1725456080190},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354015650X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015743","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:45:47Z","timestamp":1132724747000},"page":"179-188","source":"Crossref","is-referenced-by-count":11,"title":["Ambiguity and transcendence"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"363","volume":"13","author":"J-M. Autebert","year":"1979","unstructured":"J-M. Autebert, J. Beauquier, L. Boasson, and M. Nivat, \u201cQuelques Problemes Ouverts en Theorie des Langages Alge'briques,\u201d R.A.I.R.O. Theoret. Comp. Sc. 13 pp. 363\u2013379 (1979).","journal-title":"R.A.I.R.O. Theoret. Comp. Sc."},{"key":"18_CR2","unstructured":"J. Beauquier and L. Thimonier, Formal Languages and Bernoulli Processes, (to appear) 1983."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, \u201cLower Bounds for Algebraic Computation Trees,\u201d Proc. 15th ACM Symp. on Theory of Computing, pp. 80\u201386 (1983).","DOI":"10.1145\/800061.808735"},{"key":"18_CR4","unstructured":"J. Berstel, \u201cSur la densite' asymptotique des langages formels,\u201d Proc. 1st ICALP Colloquium, pp. 345\u2013368 North Holland, (1972)."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"N. Chomsky and M-P. Schutzenberger, \u201cThe Algebraic Theory of Context-Free Languages,\u201d Computer Programming and Formal Systems, pp. 118\u2013161 North Holland, (1963).","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"18_CR6","first-page":"267","volume":"10","author":"L. Comtet","year":"1964","unstructured":"L. Comtet, \u201cCalcul pratique des coefficients de Taylor d'une fonction alge'brique,\u201d Enseignement Math. 10 pp. 267\u2013270 (1964).","journal-title":"Enseignement Math."},{"key":"18_CR7","unstructured":"J.P. Crestin, \u201cUn langage non ambigu dont le carre' est d'ambiguite' inherente borne'e,\u201d Proc. 1st ICALP Colloquium, pp. 377\u2013390 North Holland, (1972)."},{"key":"18_CR8","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1950","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, J. Wiley, New-York (1950)."},{"key":"18_CR9","volume-title":"Ramanujan, Twelve Lectures Suggested by his Life and Work","author":"G. H. Hardy","year":"1940","unstructured":"G. H. Hardy, Ramanujan, Twelve Lectures Suggested by his Life and Work, Cambridge, The University Press (1940)."},{"key":"18_CR10","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. (1978)."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(82)90123-6","volume":"40","author":"R. Kemp","year":"1980","unstructured":"R. Kemp, \u201cOn the Number of Words in the Language {\u03c9\u2208\u03a3\u2022}2,\u201d Discrete Math. 40 pp. 225\u2013234 (1980).","journal-title":"Discrete Math."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00264258","volume":"14","author":"R. Kemp","year":"1980","unstructured":"R. Kemp, \u201cA Note on the density of Inherently Ambiguous Context-Free Languages,\u201d Acta Informatica 14 pp. 295\u2013298 (1980).","journal-title":"Acta Informatica"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"N. Pippenger, \u201cComputational Complexity in Algebraic Function Fields,\u201d Proc. 20th IEEE Symp. F.O.C.S., pp. 61\u201365 (1979).","DOI":"10.1109\/SFCS.1979.11"},{"key":"18_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"A. Salomaa and M. Soittola, Automata Theoretic Aspects of Formal Power Series, Springer-Verlag, New-York (1978)."},{"key":"18_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-94694-3","volume-title":"Einfuhrung in die Transzendenten Zahlen","author":"T. Schneider","year":"1957","unstructured":"Th. Schneider, Einfuhrung in die Transzendenten Zahlen, Springer Verlag, Berlin (1957)."},{"key":"18_CR16","volume-title":"Elements of the Theory of Algebraic Curves","author":"A. Seidenberg","year":"1965","unstructured":"A. Seidenberg, Elements of the Theory of Algebraic Curves, Addison-Wesley, Reading, Mass. (1965)."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0019-9958(71)90455-4","volume":"18","author":"E. Shamir","year":"1971","unstructured":"E. Shamir, \u201cSome Inherently Ambiguous Context-Free Languages,\u201d Inf. and Control 18 pp. 355\u2013363 (1971).","journal-title":"Inf. and Control"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and G. Yuval, \u201cLower Bounds from Complex Function Theory,\u201d Proc. 17th IEEE Symp. F.O.C.S., pp. 268\u2013273 (1976).","DOI":"10.1109\/SFCS.1976.19"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015743.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:09:51Z","timestamp":1607353791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354015650X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0015743","relation":{},"subject":[]}}