Inclusion problems in trace monoids

DOI10.1007/s10559-010-9231-0zbMath1288.68302OpenAlexW2026742360MaRDI QIDQ2452752

K. V. Shahbazyan, Yu. H. Shoukourian

Publication date: 5 June 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-010-9231-0

zbMATH Keywords

pattern matchingdependence graphmonoid of traces

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Algorithms on strings (68W32)

Related Items (3)

Forbidden traces and forbidden subtraces ⋮ Asynchronous trace-matching automata ⋮ On trace inclusion optimization problems

Cites Work

• Unnamed Item
• Maximal repetitions in strings
• Tree inclusion problems
• Window-accumulated subsequence matching problem is linear

This page was built for publication: Inclusion problems in trace monoids