### Abstract

Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode. Furthermore, we examine the prime intercode decomposition of intercode regular languages and design an algorithm for the intercode primality test of an intercode recognized by a finite-state automaton. We also propose an algorithm that computes the prime intercode decomposition of an intercode regular language in polynomial time. Finally, we demonstrate that the prime intercode decomposition need not be unique.

Original language | English |
---|---|

Pages (from-to) | 113-128 |

Number of pages | 16 |

Journal | Fundamenta Informaticae |

Volume | 76 |

Issue number | 1-2 |

Publication status | Published - 2007 Mar 14 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics

### Cite this

*Fundamenta Informaticae*,

*76*(1-2), 113-128.

}

*Fundamenta Informaticae*, vol. 76, no. 1-2, pp. 113-128.

**Intercode regular languages.** / Han, Yo Sub; Salomaa, Kai; Wood, Derick.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Intercode regular languages

AU - Han, Yo Sub

AU - Salomaa, Kai

AU - Wood, Derick

PY - 2007/3/14

Y1 - 2007/3/14

N2 - Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode. Furthermore, we examine the prime intercode decomposition of intercode regular languages and design an algorithm for the intercode primality test of an intercode recognized by a finite-state automaton. We also propose an algorithm that computes the prime intercode decomposition of an intercode regular language in polynomial time. Finally, we demonstrate that the prime intercode decomposition need not be unique.

AB - Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for determining whether or not a given regular language L is an intercode. If the answer is yes, our algorithm yields also the smallest index k such that L is a k-intercode. Furthermore, we examine the prime intercode decomposition of intercode regular languages and design an algorithm for the intercode primality test of an intercode recognized by a finite-state automaton. We also propose an algorithm that computes the prime intercode decomposition of an intercode regular language in polynomial time. Finally, we demonstrate that the prime intercode decomposition need not be unique.

UR - http://www.scopus.com/inward/record.url?scp=33847746959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847746959&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33847746959

VL - 76

SP - 113

EP - 128

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -