Execution information rate for some classes of automata
From MaRDI portal
Publication:899317
DOI10.1016/J.IC.2015.11.006zbMATH Open1333.68161OpenAlexW2182397176MaRDI QIDQ899317FDOQ899317
Authors: Cewei Cui, Zhe Dang, Thomas R. Fischer, 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
Recommendations
- Execution information rate for some classes of automata
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
- Sampling automata and programs
- Volume and entropy of regular timed languages: analytic approach
Cites Work
- Elements of Information Theory
- A theory of timed automata
- Membrane computing. An introduction.
- Pushdown timed automata: A binary reachability characterization and safety verification.
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Title not available (Why is that?)
- Finite state languages
- Title not available (Why is that?)
- Volume and Entropy of Regular Timed Languages: Discretization Approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Foundations of Computer Science 2003
- On the entropy of context-free languages
- Title not available (Why is that?)
- Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
- Information gain of black-box testing
Cited In (2)
This page was built for publication: Execution information rate for some classes of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899317)
