Geodesic
On process languages in finite graphs
Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XIII, Tome 248 (1998), pp. 205-215 
K. V. Shakhbazyan; Yu. G. Shoukouryan. On process languages in finite graphs. Zapiski Nauchnykh Seminarov POMI, Computational methods and algorithms. Part XIII, Tome 248 (1998), pp. 205-215. http://geodesic.mathdoc.fr/item/ZNSL_1998_248_a9/
@article{ZNSL_1998_248_a9,
     author = {K. V. Shakhbazyan and Yu. G. Shoukouryan},
     title = {On process languages in finite graphs},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {205--215},
     year = {1998},
     volume = {248},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1998_248_a9/}
}
TY  - JOUR
AU  - K. V. Shakhbazyan
AU  - Yu. G. Shoukouryan
TI  - On process languages in finite graphs
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1998
SP  - 205
EP  - 215
VL  - 248
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1998_248_a9/
LA  - ru
ID  - ZNSL_1998_248_a9
ER  - 
%0 Journal Article
%A K. V. Shakhbazyan
%A Yu. G. Shoukouryan
%T On process languages in finite graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 1998
%P 205-215
%V 248
%U http://geodesic.mathdoc.fr/item/ZNSL_1998_248_a9/
%G ru
%F ZNSL_1998_248_a9

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

Processes in an arbitrary graph and languages of processes provide descriptions of processes in pipeline systems. The properties of syntactic congruences of process languages are studied. A necessary and sufficient condition for the finiteness of a syntactic congruence is obtained. The set of finite languages of the trace monoid, which corresponds to finite processes in the graph, is considered. The unrecognizability of this set by finite automata is established.