Falucskai, János (2006) On a test for codes. ACTA MATHEMATICA ACADEMIAE PAEDAGOGICAE NYÍREGYHÁZIENSIS, 22 (1). pp. 121-125. ISSN 0866-0174
|
Text
amapn22_13.pdf Download (187kB) | Preview |
Official URL: http://www.emis.de/journals/AMAPN/index.html
Abstract
Sets of codewords can be represented by finite automata (FAs) and every FA can be represented by connection matrices or regular expressions. Our goal is to find similar systems like that and to solve one of the systems's problems in another system. Having a set of codewords we have to decide whether there are two or more sequences of codewords which form the same chain of characters of codewords. We have developed an algorithm that solves this problem by using finite automata and their deterministic finite automata.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Uniquely decipherable codes, automata, length-variable codes |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 31 Jan 2024 13:30 |
| Last Modified: | 31 Jan 2024 13:30 |
| URI: | http://real.mtak.hu/id/eprint/186854 |
Actions (login required)
 |
Edit Item |
