Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)

DOI10.1007/978-3-662-44522-8_20MaRDI QIDQ2922018zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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)

• Execution information rate for some classes of automata
• Execution information rate for some classes of automata
• Quantifying communication in synchronized languages
• Security of numerical sensors in automata
• Quantifying communication in synchronized languages
• Lossiness of communication channels modeled by transducers1
• Definitions and properties of entropy and distance for regular languages
• Similarity in languages and programs
• Generalized information-lossless automata of finite order. II
• Sampling automata and programs
• Information rate of some classes of non-regular languages: an automata-theoretic approach
• Regular language distance and entropy

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)