On the entropy of regular languages

Let L be an irreducible regular language. Let W be a non-empty set of words (or sub-words) of L and denote by L W={v∈L :w⊏̸v, ∀w∈W} the language obtained from L by forbidding all the words w in W. Then the entropy decreases strictly: ent( L W )

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2003-09, Vol.307 (1), p.93-102
Hauptverfasser:	Ceccherini-Silberstein, Tullio, Machı̀, Antonio, Scarabotti, Fabio
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Entropy Exact sciences and technology Free group Graph theory Hopfianity Language theory and syntactical analysis Mathematics Oriented graph Regular language Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Let L be an irreducible regular language. Let W be a non-empty set of words (or sub-words) of L and denote by L W={v∈L :w⊏̸v, ∀w∈W} the language obtained from L by forbidding all the words w in W. Then the entropy decreases strictly: ent( L W )
ISSN:	0304-3975 1879-2294
DOI:	10.1016/S0304-3975(03)00094-X