On process languages in finite graphs

DOI10.1007/BF02672777zbMATH Open0959.68074MaRDI QIDQ1591906FDOQ1591906

Authors: Yu. H. Shoukourian, K. V. Shakhbazyan 

Publication date: 17 January 2001

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

Recommendations

• scientific article; zbMATH DE number 3856434
• Process languages and nets
• scientific article; zbMATH DE number 3858446
• scientific article; zbMATH DE number 1515283
• scientific article; zbMATH DE number 475419

zbMATH Keywords

pipeline systemssyntactic congruences of process languages

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Lattices of processes in graphs with inputs
• Title not available (Why is that?)
• Some Remarks on Definability of Process Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1591906)