Lossiness of communication channels modeled by transducers1

DOI10.3233/COM-150050zbMath1369.94012OpenAlexW2592287474MaRDI QIDQ5283445

Cewei Cui, Zhe Dang, Oscar H. Ibarra, Thomas R. Fischer

Publication date: 21 July 2017

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-150050

zbMATH Keywords

automataShannon informationtransducers

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Similarity in languages and programs
• On the valuedness of finite transducers
• 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.
• Sampling automata and programs
• 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
• A note on finite-valued and finitely ambiguous transducers
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• 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: Lossiness of communication channels modeled by transducers1