Quantifying communication in synchronized languages

DOI10.1016/J.TCS.2016.01.042MaRDI QIDQ344766zbMATH OpenOpenAlexFDO

Authors Zhe Dang, Thomas R. Fischer, William J. III Hutton, Oscar H. Ibarra, Qin Li

Publication date 24 November 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.01.042

zbMATH Keywords

information theorycryptographycommunication complexity

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Quantifying communication in synchronized languages
• Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
• Information rate of some classes of non-regular languages: an automata-theoretic approach
• Mutual information rate between stationary Gaussian processes
• Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)

Cites work

• scientific article; zbMATH DE number 1670769 (Why is no real title available?)
• scientific article; zbMATH DE number 2038746 (Why is no real title available?)
• scientific article; zbMATH DE number 2087219 (Why is no real title available?)
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• A theory of timed automata
• Communication Complexity
• Communication complexity
• Elements of Information Theory
• Execution information rate for some classes of automata
• Execution information rate for some classes of automata
• Finite state languages
• Mathematical Foundations of Computer Science 2003
• On the entropy of context-free languages
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Similarity in languages and programs
• The complexity of decision problems for finite-turn multicounter machines
• The noncomputability of the channel capacity of context-sensitive languages
• Volume and Entropy of Regular Timed Languages: Discretization Approach

Cited in

(2)

• Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
• Quantifying communication in synchronized languages

This page was built for publication: Quantifying communication in synchronized languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344766)