@article{RUTTEN2002286,
    Abstract = {The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite (weighted) automaton; (2) the automaton is minimized by means of the quantitative notion of stream bisimulation; (3) the minimized automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts.},
    Author = {Rutten, J.J.M.M.},
    File = {Coinductive Counting- Bisimulation in Enumerative Combinatorics (Extended Abstract) - 1-s2.0-S1571066104803694-main - a.pdf},
    ISSN = {1571-0661},
    Journal = {Electronic Notes in Theoretical Computer Science},
    Note = {CMCS'2002, Coalgebraic Methods in Computer Science (Satellite Event of ETAPS 2002)},
    Number = {1},
    Pages = {286-304},
    Title = {Coinductive Counting: Bisimulation in Enumerative Combinatorics (Extended Abstract)},
    URL = {https://www.sciencedirect.com/science/article/pii/S1571066104803694},
    Volume = {65},
    Year = {2002},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S1571066104803694},
    bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80369-4},
    date-added = {2023-03-28 07:47:40 +0200},
    date-modified = {2023-03-28 07:47:40 +0200},
    doi = {10.1016/S1571-0661(04)80369-4}
}

@article{RUTTEN2002286, Abstract = {The recently developed coinductive calculus of streams finds here a further application in enumerative combinatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite (weighted) automaton; (2) the automaton is minimized by means of the quantitative notion of stream bisimulation; (3) the minimized automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts.}, Author = {Rutten, J.J.M.M.}, File = {Coinductive Counting- Bisimulation in Enumerative Combinatorics (Extended Abstract) - 1-s2.0-S1571066104803694-main - a.pdf}, ISSN = {1571-0661}, Journal = {Electronic Notes in Theoretical Computer Science}, Note = {CMCS'2002, Coalgebraic Methods in Computer Science (Satellite Event of ETAPS 2002)}, Number = {1}, Pages = {286-304}, Title = {Coinductive Counting: Bisimulation in Enumerative Combinatorics (Extended Abstract)}, URL = {https://www.sciencedirect.com/science/article/pii/S1571066104803694}, Volume = {65}, Year = {2002}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S1571066104803694}, bdsk-url-2 = {https://doi.org/10.1016/S1571-0661(04)80369-4}, date-added = {2023-03-28 07:47:40 +0200}, date-modified = {2023-03-28 07:47:40 +0200}, doi = {10.1016/S1571-0661(04)80369-4} }