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.

, , ,
Software Engineering [SEN]
Computer Security

Rutten, J. (2002). Coinductive counting with weighted automata. Software Engineering [SEN]. CWI.