Variants of codes and indecomposable languages

Authors:
Arto Salomaa;Kai Salomaa;Sheng Yu
Affiliations:
Turku Centre for Computer Science, Joukahaisenkatu 3-5 B, 20520 Turku, Finland;Department of Computing and Information Science, Queen's University, Kingston, Ont., Canada K7L 3N6;Department of Computer Science, The University of Western Ontario, London, Ont., Canada N6A 5B7
Venue:
Information and Computation
Year:
2009

Citing 8
Cited 1

Handbook of Formal Languages

Handbook of Formal Languages
Factorizations of languages and commutativity conditions

Acta Cybernetica
On the existence of prime decompositions

Theoretical Computer Science
The Power of Commuting with Finite Sets of Words

Theory of Computing Systems
Commutation of binary factorial languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory
The generalization of generalized automata: expression automata

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
The finest homophonic partition and related code concepts

IEEE Transactions on Information Theory
On multiset decipherable codes (Corresp.)

IEEE Transactions on Information Theory

On language decompositions and primality

Rainbow of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We continue the investigation of representing a language as a catenation of languages, each of which cannot be further decomposed in a nontrivial fashion. We study such prime decompositions, both finite and infinite ones. The notion of a length code, an extension of the notion of a code leads to general results concerning decompositions of star languages. Special emphasis is on the decomposition of regular languages. Also some open problems are mentioned.