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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. V. Shakhbazyan, “On the algebra of processes in graphs,Kibernetika,6, 38–42 (1988).
K. V. Shakhbazyan, “Representation of the lattice of processes in a graph by a pair algebra,”Kibernetika,4, 114–116 (1990).
J. Hartmanis and R. E. Stearns, “Pair algebra and its application to automata theory,”Inf. Control,7, 485–507 (1964).
V. Diekert,Combinatorics on Traces, Lect. Notes Comp. Sci.,454 (1990).
Additional information
Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 248, 1998, pp. 205–215.
Translated by K. V. Shakhbazyan.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V., Shoukourian, Y.H. On process languages in finite graphs. J Math Sci 101, 3348–3354 (2000). https://doi.org/10.1007/BF02672777
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02672777