Intercode Regular Languages

Authors:
Yo-Sub Han;Kai Salomaa;Derick Wood
Affiliations:
System Technology Division, Korea Institute of Science and Technology, P.O. BOX 131, Cheongryang, Seoul, Korea. E-mail: emmous@kist.re.kr;School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada. E-mail: ksalomaa@cs.queensu.ca;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR. E-mail: dwood@cs.ust.hk
Venue:
Fundamenta Informaticae
Year:
2007

Citing 13
Cited 4

Transducers and the decidability of independence in free monoids

Selected papers of the second international colloquium on Words, languages and combinatorics
Codes

Handbook of formal languages, vol. 1
Characterization of Glushkov automata

Theoretical Computer Science
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Theory of Codes

Theory of Codes
Introduction to Algorithms

Introduction to Algorithms
Factorizations of languages and commutativity conditions

Acta Cybernetica
On the Decomposition of Finite Languages

On the Decomposition of Finite Languages
A characterization of Thompson digraphs

Discrete Applied Mathematics
Overlap-Free regular languages

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Prefix-Free regular-expression matching

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Outfix-free regular languages and prime outfix-free decomposition

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Prime decompositions of regular languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

Fundamenta Informaticae
Deciding determinism of caterpillar expressions

Theoretical Computer Science
Deterministic caterpillar expressions

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
K-Comma Codes and Their Generalizations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.