On process languages in finite graphs

DOI10.1007/BF02672777zbMath0959.68074MaRDI QIDQ1591906

Yu. H. Shoukourian, K. V. Shakhbazyan

Publication date: 17 January 2001

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

pipeline systemssyntactic congruences of process languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Algebra of processes in graphs
• Pair algebra and its application to automata theory

This page was built for publication: On process languages in finite graphs