Some Remarks on Regular Factorizations

			S. Konstantinidis

The concept of word factorization constitutes an important tool in 
various areas of formal languages such as theory of codes and word 
combinatorics. Recently, a paper by Karhum\"aki, Plandowski, and 
Rytter \cite{kpr} was devoted entirely to algorithmic problems of 
word factorizations. In the present paper we  define certain automata 
corresponding to regular factorizations that constitute the main tools
for answering algorithmic questions related to such factorizations. 
In particular, we revisit some of the problems solved in \cite{kpr} 
and give an answer to a question raised in \cite{kpr}. Moreover,
we consider a few additional problems  related to factorizations.
Our presentation provides {\it explicit\/} constructions 
and time complexity requirements in the proposed algorithms.