The entropy of recursive Markov processes
Benny Brodda · 1967
The aim of this communication is to obtain an explicit formula for calculating the entropy of a source which behaves in accordance with the rules of an arbitrary Phrase Structure Grammar, in which relative probabilities are attached to the rules in the grammar.With this aim in mind we introduce an alte~rnative definition of the concept of a PSG as a set of self-embedded (re-Cursive) Finite State Grammars;when the probabilities are taken into account in such a grammar we call it a Recursive Markov Process.