K. Shahbazyan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to(More)
In this paper we study the recognizability and de.nability on existential monadic second order (EMSO) logic of languages related to homogeneous %ow event structures (HFES), i.e., the languages of con.gurations (posets) and the languages of proving sequences (words). An HFES is speci.ed by an arbitrary poset G = (V;6) and a .nite FES F as a result of copying(More)
  • 1