Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
From MaRDI portal
Publication:2922018
DOI10.1007/978-3-662-44522-8_20zbMATH Open1425.68192OpenAlexW201022349MaRDI QIDQ2922018FDOQ2922018
Authors: Cewei Cui, Zhe Dang, Thomas R. Fischer, 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
Recommendations
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- Execution information rate for some classes of automata
- Execution information rate for some classes of automata
- Automaticity. I: Properties of a measure of descriptional complexity
- On the Non-deterministic Communication Complexity of Regular Languages
Cited In (12)
- Regular language distance and entropy
- Security of numerical sensors in automata
- Definitions and properties of entropy and distance for regular languages
- Generalized information-lossless automata of finite order. II
- Information rate of some classes of non-regular languages: an automata-theoretic approach
- Quantifying communication in synchronized languages
- Similarity in languages and programs
- Lossiness of communication channels modeled by transducers1
- Execution information rate for some classes of automata
- Execution information rate for some classes of automata
- Sampling automata and programs
- Quantifying communication in synchronized languages
This page was built for publication: Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922018)
