Formulae and Asymptotics for Coefficients of Algebraic Functions
暂无分享,去创建一个
[1] Fredrik Johansson,et al. Ore Polynomials in Sage , 2013, Computer Algebra and Polynomials.
[2] Igor Pak,et al. Counting With Irrational Tiles , 2014 .
[3] Catalin Dima,et al. Zeta functions of finite-type-Dyck shifts are N-algebraic , 2014, 2014 Information Theory and Applications Workshop (ITA).
[4] Nivat G. Päun,et al. Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.
[5] Peter Clote,et al. Expected Distance between Terminal Nucleotides of Rna Secondary Structures , 2011 .
[6] Boris Adamczewski,et al. On vanishing coefficients of algebraic power series over fields of positive characteristic , 2012 .
[7] Frédérique Bassino,et al. Combinatorial specification of permutation classes , 2012, 1204.0797.
[8] Basile Morcrette,et al. Fully Analyzing an Algebraic Pólya Urn Model , 2012, LATIN.
[9] Pawel Hitczenko,et al. Enumeration and asymptotics of restricted compositions having the same number of parts , 2012, Discret. Appl. Math..
[10] Michèle Soria,et al. Algorithms for combinatorial structures: Well-founded systems and Newton iterations , 2011, J. Comb. Theory, Ser. A.
[11] J. Bell,et al. On the set of zero coefficients of a function satisfying a linear differential equation , 2011, Mathematical Proceedings of the Cambridge Philosophical Society.
[12] Wolfgang Woess,et al. Context-free pairs of groups II — Cuts, tree sets, and random walks , 2009, Discret. Math..
[13] Tullio Ceccherini-Silberstein,et al. Context-free pairs of groups I: Context-free pairs and graphs , 2009, Eur. J. Comb..
[14] H. Bouzid. Combinatoire analytique des langages réguliers et algébriques , 2012 .
[15] Michael Drmota,et al. Infinite Systems of Functional Equations and Gaussian Limiting Distributions , 2012 .
[16] C. Reutenauer,et al. On an algebraicity theorem of Kontsevich , 2012 .
[17] M. Kontsevich. Noncommutative identities , 2011, 1109.2469.
[18] Philippe Flajolet,et al. On Buffon machines and numbers , 2009, SODA '11.
[19] C. Reutenauer,et al. Noncommutative Rational Series with Applications , 2010 .
[20] Markus E. Nebel,et al. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics , 2010, LATA.
[21] Wojciech Rytter,et al. On the Maximal Number of Cubic Runs in a String , 2010, LATA.
[22] Manuel Kauers,et al. When can we decide that a P-finite sequence is positive? , 2010, ArXiv.
[23] Yann Ponty,et al. Multi-dimensional Boltzmann Sampling of Languages , 2010, 1002.0046.
[24] Páidí Creed,et al. DMTCS Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) , 2010 .
[25] J. Morgenbesser. Square root singularities of infinite systems of functional equations , 2010 .
[26] M. Droste,et al. Handbook of Weighted Automata , 2009 .
[27] Manuel Kauers,et al. The complete Generating Function for Gessel Walks is Algebraic , 2009, ArXiv.
[28] Alexis Darrasse,et al. Fast and sound random generation for automated testing and benchmarking in objective Caml , 2009, ML '09.
[29] Carsten Schneider,et al. A Symbolic Summation Approach to Find Optimal Nested Sum Representations , 2009, ArXiv.
[30] A. Sokal. A ridiculously simple and explicit implicit function theorem , 2009, 0902.0069.
[31] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[32] M. Drmota. Random Trees: An Interplay between Combinatorics and Probability , 2009 .
[33] P. Flajolet,et al. Analytic Combinatorics: RANDOM STRUCTURES , 2009 .
[34] I. Petre,et al. Algebraic Systems and Pushdown Automata , 2009 .
[35] Manuel Kauers,et al. Automatic Classification of Restricted Lattice Walks , 2008, 0811.2899.
[36] Alexis Darrasse. Random XML sampling the Boltzmann way , 2008, ArXiv.
[37] Christoph Koutschan,et al. Regular languages and their generating functions: The inverse problem , 2008, Theor. Comput. Sci..
[38] O. Bodini,et al. Distances in random Apollonian network structures , 2007, 0712.2129.
[39] C. Richard. Limit Distributions and Scaling Functions , 2007, 0704.0716.
[40] Éric Schost,et al. Differential equations for algebraic functions , 2007, ISSAC '07.
[41] M. Bousquet-M'elou. Rational and algebraic series in combinatorial enumeration , 2008, 0805.0588.
[42] Mireille Bousquet-Mélou,et al. Polynomial equations with one catalytic variable, algebraic series and map enumeration , 2006, J. Comb. Theory, Ser. B.
[43] Cyril Banderier,et al. Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area † , 2006 .
[44] Mike D. Atkinson,et al. Simple permutations and pattern restricted permutations , 2005, Discret. Math..
[45] M. Lothaire,et al. Applied Combinatorics on Words , 2005 .
[46] M. Lothaire. Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .
[47] Alois Panholzer,et al. Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function , 2005, J. Autom. Lang. Comb..
[48] Alfred J. van der Poorten,et al. Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..
[49] Cyril Banderier,et al. Why Delannoy numbers? , 2004, ArXiv.
[50] Philippe Flajolet,et al. Mathematics and Computer Science Iii: "Algorithms, Trees, Combinatorics And Probabilities" , 2004 .
[51] Guy Louchard,et al. Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.
[52] I. Goulden,et al. Combinatorial Enumeration , 2004 .
[53] Rainer Kemp. A note on the density of inherently ambiguous context-free languages , 2004, Acta Informatica.
[54] A. Maass,et al. Dynamics and randomness II , 2004 .
[55] S. Lalley. Algebraic Systems of Generating Functions and Return Probabilities for Random Walks , 2004 .
[56] Tullio Ceccherini-Silberstein,et al. Growth-sensitivity of context-free languages , 2003, Theor. Comput. Sci..
[57] J. Shallit,et al. Automatic Sequences: Contents , 2003 .
[58] Yann Ponty,et al. Random generation of structured genomic sequences , 2003 .
[59] Tullio Ceccherini-Silberstein,et al. Growth and ergodicity of context-free languages , 2002 .
[60] Philippe Flajolet,et al. Basic analytic combinatorics of directed lattice paths , 2002, Theor. Comput. Sci..
[61] Mireille Bousquet-Mélou,et al. Generating functions for generating trees , 2002, Discret. Math..
[62] Philippe Flajolet,et al. Mathematics and Computer Science II , 2002 .
[63] C. Banderier,et al. Lattice Paths With An Infinite Set Of Jumps , 2002 .
[64] C. Banderier. Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps , 2002 .
[65] Alberto Bertoni,et al. Random Generation for Finitely Ambiguous Context-free Languages , 2001, RAIRO Theor. Informatics Appl..
[66] Philippe Flajolet,et al. Random maps, coalescing saddles, singularity analysis, and Airy phenomena , 2001, Random Struct. Algorithms.
[67] Andrea Frosini,et al. A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function , 2001, Adv. Appl. Math..
[68] Cyril Banderier,et al. Combinatoire analytique des chemins et des cartes , 2001 .
[69] M. Bousquet-Mélou,et al. Walks on the slit plane , 2000, math/0012230.
[70] Philippe Duchon,et al. On the enumeration and generation of generalized Dyck words , 2000, Discret. Math..
[71] Wolfdieter Lang,et al. On Generalizations of the Stirling Number Triangles , 2000 .
[72] Philippe Flajolet,et al. Analytic combinatorics of non-crossing configurations , 1999, Discret. Math..
[73] Philippe Duchon. Q-grammars and wall polyominoes , 1999 .
[74] Alain Denise,et al. Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..
[75] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .
[76] Alan R. Woods. Coloring rules for finite trees, and probabilities of monadic second order sentences , 1997, Random Struct. Algorithms.
[77] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[78] Michael Drmota,et al. Systems of functional equations , 1997, Random Struct. Algorithms.
[79] Gilbert Labelle,et al. Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.
[80] Rostislav Grigorchuk,et al. On problems related to growth, entropy, and spectrum in group theory , 1997 .
[81] Jean Berstel,et al. Towards an Algebraic Theory of Context-Free Languages , 1996, Fundam. Informaticae.
[82] Michael S. Waterman,et al. Applications of combinatorics to molecular biology , 1996 .
[83] R. Graham,et al. Handbook of Combinatorics , 1995 .
[84] Michael Drmota,et al. Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions , 1995, Theor. Comput. Sci..
[85] P.A. Pevzner,et al. Open combinatorial problems in computational molecular biology , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.
[86] Philippe Flajolet,et al. A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..
[87] Michael Drmota. Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems , 1994, J. Comb. Theory, Ser. A.
[88] Dinesh Manocha,et al. SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .
[89] Maylis Delest,et al. Algebraic Languages: A Bridge between Combinatorics and Computer Science , 1994, Formal Power Series and Algebraic Combinatorics.
[90] S. Lalley. Finite Range Random Walk on Free Groups and Homogeneous Trees , 1993 .
[91] Rainer Kemp. Random Multidimensional Binary Trees , 1993, J. Inf. Process. Cybern..
[92] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[93] Philippe Flajolet,et al. Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..
[94] Réal Ouellet,et al. Œuvres complètes I , 1990 .
[95] Frits Beukers,et al. Monodromy for the hypergeometric functionnFn−1 , 1989 .
[96] Philippe Flajolet,et al. Prefixes of Infinite Words and Ambiguous Context-Free Languages , 1987, Inf. Process. Lett..
[97] Philippe Flajolet,et al. Analytic Models and Ambiguity of Context-free Languages* , 2022 .
[98] D. V. Chudnovsky,et al. On expansion of algebraic functions in power and Puiseux series, II , 1987, J. Complex..
[99] D. V. Chudnovsky,et al. On expansion of algebraic functions in power and Puiseux series, I , 1986, J. Complex..
[100] R. Stanley. What Is Enumerative Combinatorics , 1986 .
[101] Michael F. Singer,et al. Algebraic relations among solutions of linear di erential equations , 1986 .
[102] Y. Sibuya,et al. The reciprocals of solutions of linear ordinary differential equations , 1985 .
[103] Gérard Viennot. Enumerative combinatorics and algebraic languages , 1985, FCT.
[104] L. Lipshitz,et al. Power series solutions of algebraic differential equations , 1984 .
[105] Jacques Cohen,et al. Uniform Random Generation of Strings in a Context-Free Language , 1983, SIAM J. Comput..
[106] Gérard Viennot,et al. Algebraic Languages and Polyominoes Enumeration , 1983, Theor. Comput. Sci..
[107] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[108] D. Klarner,et al. Asymptotics for coefficients of algebraic functions , 1981 .
[109] A. Joyal. Une théorie combinatoire des séries formelles , 1981 .
[110] David E. Muller,et al. Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems , 1981 .
[111] G. Rauzy,et al. Suites algébriques, automates et substitutions , 1980 .
[112] J. Moon,et al. On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.
[113] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[114] Matti Soittola,et al. Positive Rational Sequences , 1976, Theor. Comput. Sci..
[115] L. Comtet,et al. Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .
[116] Donald F. Stanat,et al. Formal languages and power series , 1971, STOC.
[117] J. Berstel,et al. Sur les pôles et le quotient de Hadamard de séries N-rationnelles , 1971 .
[118] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[119] Harry Furstenberg,et al. Algebraic functions over finite fields , 1967 .
[120] F. Trèves. Topological vector spaces, distributions and kernels , 1967 .
[121] J. Shepherdson,et al. Computer programming and formal systems , 1965 .
[122] Leon W. Cohen,et al. Conference Board of the Mathematical Sciences , 1963 .
[123] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .
[124] M. Schützenberger. On a Theorem of R. Jungen , 1962 .
[125] S C Kleene,et al. Representation of Events in Nerve Nets and Finite Automata , 1951 .
[126] Reinwald Jungen. Sur les séries de Taylor n'ayant que des singularités algébrico-logarithmiques sur leur cercle de convergence , 1931 .
[127] Jules Tannery,et al. Propriétés des intégrales des équations différentielles linéaires à coefficients variables , 1875 .
[128] James Cockle. LVIII. On transcendental and algebraic solution , 1861 .