| Abstract: | 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. Bibliography: 4 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 248, 1998, pp. 205–215. Translated by K. V. Shakhbazyan. |
