scientific article; zbMATH DE number 6665189

DOI10.25596/JALC-2015-045MaRDI QIDQ5507035zbMATH OpenFDO

Authors R. D. Giri

Publication date 16 December 2016

Full work available at URL https://doi.org/10.25596/JALC-2015-045

zbMATH Keywords

recognizability of codesright complete codessemaphore codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4092795
• On completely regular codes
• scientific article; zbMATH DE number 4110626
• On a problem of satyanarayana regarding the recognizability of codes
• On complete regularity of extended codes
• scientific article; zbMATH DE number 62492
• On the complete decoding of constrained codes
• Characterizing completely regular codes from an algebraic viewpoint
• On the complete decoding of binary linear codes (Corresp.)
• Decompositions of recognizable strong maximal codes

Cited in

(2)

• Right complete codes
• On a problem of satyanarayana regarding the recognizability of codes

This page was built for publication:

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