Execution information rate for some classes of automata
From MaRDI portal
Publication:899317
DOI10.1016/j.ic.2015.11.006zbMath1333.68161OpenAlexW2182397176MaRDI QIDQ899317
Cewei Cui, Thomas R. Fischer, Zhe Dang, Oscar H. Ibarra
Publication date: 28 December 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.11.006
Related Items (2)
Quantifying communication in synchronized languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information gain of black-box testing
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Membrane computing. An introduction.
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- Finite state languages
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Mathematical Foundations of Computer Science 2003
- Elements of Information Theory
- On the entropy of context-free languages
This page was built for publication: Execution information rate for some classes of automata