Quantifying communication in synchronized languages

DOI10.1016/j.tcs.2016.01.042zbMath1353.68074OpenAlexW2342276679MaRDI QIDQ344766

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

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

cryptographyinformation theorycommunication complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Similarity in languages and programs
• Execution information rate for some classes of automata
• Communication complexity
• The complexity of decision problems for finite-turn multicounter machines
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Finite state languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Communication Complexity
• Execution Information Rate for Some Classes of Automata
• Mathematical Foundations of Computer Science 2003
• Elements of Information Theory
• On the entropy of context-free languages
• The noncomputability of the channel capacity of context-sensitive languages

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