On the entropy and spectral radius of finite-state machines

A.K. Raina, Somanath Majhi · 2001

A large class of discrete-event processes are modelled using finite-state machines and regular languages. Here we address the problems of spectral radius and entropy of a finite state machine and show that the entropy of a system is upper bounded by its event set.

Read the paper · More papers on PaperTik