Coinductive Counting With Weighted Automata Export

@misc{Rutten03Weighted, abstract = {A general methodology is developed to compute the solution of 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 reduced by means of the quantitative notion of stream bisimulation; (3) the reduced 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.}, citeulike-article-id = {5910013}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2930}, keywords = {automata, trace\_semantics}, posted-at = {2009-10-08 16:58:51}, priority = {2}, title = {Coinductive Counting With Weighted Automata}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2930}, year = {2002} }

TY - ELEC ID - Rutten03Weighted L3 - citeulike-article-id:5910013 N2 - A general methodology is developed to compute the solution of 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 reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an expression (in terms of stream constants and operators) that represents the stream of all counts. TI - Coinductive Counting With Weighted Automata KW - automata KW - trace_semantics AU - Rutten, JJMM PY - 2002/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2930 ER -