Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
From MaRDI portal
Publication:2922018
DOI10.1007/978-3-662-44522-8_20zbMath1425.68192OpenAlexW201022349MaRDI QIDQ2922018
Cewei Cui, Thomas R. Fischer, Zhe Dang, Oscar H. Ibarra
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44522-8_20
Related Items (8)
Lossiness of communication channels modeled by transducers1 ⋮ Quantifying Communication in Synchronized Languages ⋮ Similarity in languages and programs ⋮ Security of Numerical Sensors in Automata ⋮ Execution information rate for some classes of automata ⋮ Regular Language Distance and Entropy ⋮ Definitions and properties of entropy and distance for regular languages ⋮ Sampling automata and programs
This page was built for publication: Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach