Intercode regular languages

Yo Sub Han, Kai Salomaa, Derick Wood

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)113-128
Number of pages16
JournalFundamenta Informaticae
Volume76
Issue number1-2
Publication statusPublished - 2007 Mar 14

Fingerprint

Formal languages
Regular Languages
Finite State Automata
Decompose
Finite automata
Decomposition
Primality test
Polynomials
Structural Properties
Polynomial-time Algorithm
Polynomial time
Structural properties
Demonstrate

All Science Journal Classification (ASJC) codes

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

Cite this

Han, Y. S., Salomaa, K., & Wood, D. (2007). Intercode regular languages. Fundamenta Informaticae, 76(1-2), 113-128.
Han, Yo Sub ; Salomaa, Kai ; Wood, Derick. / Intercode regular languages. In: Fundamenta Informaticae. 2007 ; Vol. 76, No. 1-2. pp. 113-128.
@article{2e19e72d3c914a4a8b6560b39995b95d,
title = "Intercode regular languages",
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.",
author = "Han, {Yo Sub} and Kai Salomaa and Derick Wood",
year = "2007",
month = "3",
day = "14",
language = "English",
volume = "76",
pages = "113--128",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

Han, YS, Salomaa, K & Wood, D 2007, 'Intercode regular languages', Fundamenta Informaticae, vol. 76, no. 1-2, pp. 113-128.

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

In: Fundamenta Informaticae, Vol. 76, No. 1-2, 14.03.2007, p. 113-128.

Research output: Contribution to journalArticle

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 -

Han YS, Salomaa K, Wood D. Intercode regular languages. Fundamenta Informaticae. 2007 Mar 14;76(1-2):113-128.