Geodesic
A solvability condition for arbitrary formal grammars
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 196-198.

Voir la notice de l'article provenant de la source Math-Net.Ru

In the paper, approaches to solving the systems of non-commutative polynomial equations in the form of formal power series (FPS) based on the connection with the corresponding commutative equations are developed. Every FPS is mapped to its commutative image — power series, which is obtained under the assumption that the symbols denote commutative variables assigned as values in the field of complex numbers. The consistency of the system of noncommutative polynomial equations, which is not directly connected with the consistency of its commutative image, is investigated. However, the analogue of implicit mapping theorem to arbitrary formal grammars (non-commutative systems) is obtained, namely if the rank of Jacoby matrix for the commutative image of a system of equations is maximal, then the initial noncommutative system of equations has a unique solution in the form of FPS.
Keywords: systems of polynomial equations, formal power series, commutative image
Mots-clés : non-commutative variables, Jacobian. 
@article{PDMA_2019_12_a54,
     author = {I. V. Kolbasina and K. V. Safonov},
     title = {A solvability condition for arbitrary formal grammars},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {196--198},
     publisher = {mathdoc},
     number = {12},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a54/}
}
TY  - JOUR
AU  - I. V. Kolbasina
AU  - K. V. Safonov
TI  - A solvability condition for arbitrary formal grammars
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 196
EP  - 198
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a54/
LA  - ru
ID  - PDMA_2019_12_a54
ER  - 
%0 Journal Article
%A I. V. Kolbasina
%A K. V. Safonov
%T A solvability condition for arbitrary formal grammars
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 196-198
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a54/
%G ru
%F PDMA_2019_12_a54
I. V. Kolbasina; K. V. Safonov. A solvability condition for arbitrary formal grammars. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 196-198. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a54/

[1] Egorushkin O. I., Kolbasina I. V., Safonov K. V., “On solvability of systems of symbolic polynomial equations”, Zhurn. SFU. Ser. Matem. i fiz., 9:2 (2016), 166–172 | MR

[2] Egorushkin O. I., Kolbasina I. V., Safonov K. V., “Analog teoremy o neyavnom otobrazhenii dlya formalnykh grammatik”, Prikladnaya diskretnaya matematika. Prilozhenie, 2017, no. 10, 149–151

[3] Glushkov V. M., Tseitlin G. E., Yuschenko E. L., Algebra. Yazyki. Programmirovanie, Naukova dumka, Kiev, 1973 | MR

[4] Salomaa A., Soitolla M., Automata-Theoretic Aspects of Formal Power Series, Springer Verlag, N.Y., 1978 | MR | Zbl

[5] Semenov A. L., “Algoritmicheskie problemy dlya stepennykh ryadov i kontekstno-svobodnykh grammatik”, Dokl. AN SSSR, 1973, no. 212, 50–52 | Zbl