Uniformly synchronous limited codes

DOI10.1007/BF02573539MaRDI QIDQ1206775zbMATH OpenFDO

Authors Supriya Mohanty, M. V. Satyanarayana

Publication date 1 April 1993

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/135205

zbMATH Keywords

free monoidslimited codeprefix codesynchronous codes

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Review text

This work continues the investigation of the article [the authors, Semigroup Forum 45, 364-371 (1992)] by determining conditions under which a limited code is uniformly synchronous and in particular when it is a prefix code. It is shown that when \(X\) is a right complete \((p,q)\)- limited code then it is a maximal prefix code. It is also shown that if \(X\) is a prefix \((p,q)\)-limited code with \(0<p+q\leq 3\), where \(p\neq 3\), then \(X\) is uniformly synchronous iff \(X\) satisfies the \(F-d\) condition for some natural number \(d\). Many other properties of such codes are established.

Recommendations

• Uniformly synchronous codes
• scientific article; zbMATH DE number 2145643
• Limited semaphore codes
• Codes with bounded synchronization delay
• scientific article; zbMATH DE number 679831

Cites work

• A combinatorial property of codes having finite synchronization delay
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)

Cited in

(3)

• Limited semaphore codes
• Uniformly synchronous codes
• scientific article; zbMATH DE number 679831 (Why is no real title available?)

This page was built for publication: Uniformly synchronous limited codes

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