Two classes of languages related to the prefix codes

DOI10.1080/00207160310001597198zbMATH Open1103.68597OpenAlexW2027534853MaRDI QIDQ4464293FDOQ4464293

Authors: Ronghua Zhang, Yanying Cai 

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160310001597198

Recommendations

• n-Prefix–suffix languages^∗
• scientific article; zbMATH DE number 4078833
• Publication:4332299
• Publication:3028876
• K-catenation and applications:k-prefix codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• Title not available (Why is that?)
• A note on the free submonoids of the monoid of prefix codes

Cited In (6)

• Some remarks on prefix and suffix codes
• n-Prefix–suffix languages^∗
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Two classes of languages related to the prefix codes

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