Compression of Words Over a Partially Commutative Alphabet

DOI10.1109/TIT.2004.830754MaRDI QIDQ3547591zbMATH OpenOpenAlexFDO

Authors S. A. Savari

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2004.830754

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Measures of information, entropy (94A17)

Recommendations

• scientific article; zbMATH DE number 2135138
• CONCUR 2003 - Concurrency Theory
• Concurrency measure in commutation monoids
• Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
• Two optimal parallel algorithms on the commutation class of a word

Cited in

(5)

• Concurrency measure in commutation monoids
• scientific article; zbMATH DE number 3972221 (Why is no real title available?)
• scientific article; zbMATH DE number 2135138 (Why is no real title available?)
• Word Problems and Membership Problems on Compressed Words
• A new algorithm for compression of partially commutative alphabets

This page was built for publication: Compression of Words Over a Partially Commutative Alphabet

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