Falucskai, János (2008) On equivalence of two tests for codes. ACTA MATHEMATICA ACADEMIAE PAEDAGOGICAE NYÍREGYHÁZIENSIS, 24 (2). pp. 249-256. ISSN 0866-0174
|
Text
amapn24_25.pdf Download (132kB) | Preview |
Official URL: http://www.emis.de/journals/AMAPN/index.html
Abstract
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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 01 Feb 2024 10:05 |
| Last Modified: | 01 Feb 2024 10:05 |
| URI: | http://real.mtak.hu/id/eprint/186959 |
Actions (login required)
 |
Edit Item |
