Analitic approach to context-free languages in the Greibach normal form

Context-free languages are considered as formal power series which are solutions of the polynomial equations systems with noncommutative multiplication of variables. It is suggested to investigate these systems in Greibach normal form that allows to research it more effectively. Commutative images of languages and defining systems are considered in complex domain.