Commutation of binary factorial languages

Authors:
Anna E. Frid
Affiliations:
Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia and Novosibirsk State University
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 2
Cited 3

Commutation with codes

Theoretical Computer Science - The art of theory
The power of commuting with finite sets of words

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

Length Codes, Products of Languages and Primality

Language and Automata Theory and Applications
Variants of codes and indecomposable languages

Information and Computation
On language decompositions and primality

Rainbow of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We solve the commutation equation AB = BA for binary factorial languages A and B. As we show, the situations when such languages commute can be naturally classified. The result is based on the existence and uniqueness of a canonical decomposition of a factorial language, proved by S. V. Avgustinovich and the author in 2005. It continues investigation of the semigroup of factorial languages.