On equivalence of two tests for codes

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis

J. Falucskai¹ 

[1] College of Nyíregyháza

关键词: Sardinas-Patterson algorithm.;   

DOI  :  

学科分类：数学（综合）

来源: Academia Paedagogica Nyiregyhaziensis. Acta Mathematica

【 摘 要 】

Our goal is to show the equivalence between two algorithms concerning uniquely decipherable codes. We show an automaton that solves this problem, and we define remainders for the states of automaton. Finally we show that remainders compose the sets of the algorithm of Sardinas-Patterson.

【 授权许可】

Unknown