Canonical decomposition of a regular factorial language

Authors:
S. V. Avgustinovich;A. E. Frid
Affiliations:
Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia;Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 1
Cited 2

The power of commuting with finite sets of words

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Simple equations on binary factorial languages

Theoretical Computer Science
Regular ideal languages and their boolean combinations

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider decompositions of factorial languages to concatenations of factorial languages and prove that if the factorial language is regular, then so are the factors of its canonical decomposition.