Entropy and Expected Acceptance Counts for Finite Automata

DOI10.1109/TIT.2003.821997zbMATH Open1301.94050OpenAlexW2092354369MaRDI QIDQ3547487FDOQ3547487

Authors: Nicholas Pippenger 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2003.821997

Recommendations

• scientific article; zbMATH DE number 1979537
• scientific article; zbMATH DE number 3974332
• On Distributions Computable by Random Walks on Graphs
• scientific article; zbMATH DE number 822051
• Multiple usage of random bits in finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17) Prefix, length-variable, comma-free codes (94A45)

Cited In (2)

• Title not available (Why is that?)
• Efficient Computation of the Relative Entropy of Probabilistic Automata

This page was built for publication: Entropy and Expected Acceptance Counts for Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547487)