Quantifying Communication in Synchronized Languages

DOI10.1007/978-3-319-21398-9_50zbMath1465.68069MaRDI QIDQ3196422

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

Publication date: 29 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_50

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

94A60: Cryptography

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

Security of Numerical Sensors in Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Similarity in languages and programs
• 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.
• Membrane computing. An introduction.
• Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach
• 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