@InProceedings{   Bousquet-Melou:STACS:2005,
  Author        = "Bousquet-M{\'e}lou, Mireille",
  Editor        = "Diekert, Volker and Durand, Bruno",
  Abstract      = "Numerous families of simple discrete objects (words, trees, lattice walks...) are counted by a rational or algebraic generating function. Whereas it seems that objects with a rational generating function have a structure very similar to the structure of words of a regular language, objects with an algebraic generating function remain more mysterious. Some of them, of course, exhibit a clear ``algebraic'' structure, which recalls the structure of words of context-free languages. For many other objects, such a structure has not yet been discovered. We list several examples of this type, and discuss various methods for proving the algebraicity of a generating function.",
  Address       = "Berlin, Heidelberg",
  BookTitle     = "Proc. of STACS'05",
  date-added    = "2018-11-23 18:43:31 +0100",
  date-modified = "2020-10-03 20:06:32 +0200",
  ISBN          = "978-3-540-31856-9",
  Pages         = "18--35",
  Publisher     = "Springer Berlin Heidelberg",
  Title         = "Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages",
  Year          = "2005",
  File          = "Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages.pdf"
}

@InProceedings{ Bousquet-Melou:STACS:2005, Author = "Bousquet-M{\'e}lou, Mireille", Editor = "Diekert, Volker and Durand, Bruno", Abstract = "Numerous families of simple discrete objects (words, trees, lattice walks...) are counted by a rational or algebraic generating function. Whereas it seems that objects with a rational generating function have a structure very similar to the structure of words of a regular language, objects with an algebraic generating function remain more mysterious. Some of them, of course, exhibit a clear ``algebraic'' structure, which recalls the structure of words of context-free languages. For many other objects, such a structure has not yet been discovered. We list several examples of this type, and discuss various methods for proving the algebraicity of a generating function.", Address = "Berlin, Heidelberg", BookTitle = "Proc. of STACS'05", date-added = "2018-11-23 18:43:31 +0100", date-modified = "2020-10-03 20:06:32 +0200", ISBN = "978-3-540-31856-9", Pages = "18--35", Publisher = "Springer Berlin Heidelberg", Title = "Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages", Year = "2005", File = "Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages.pdf" }