Bisimulation equivalence and commutative context-free grammars

Speaker(s)

Sławomir Lasota

Affiliation

Uniwersytet Warszawski

Date

Dec. 20, 2006, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

The topic will be the class of processes (transition systems) generated from the commutative context-free grammars. I will present a method enabling to prove decidability (and to compute the complexity) of different variants of bisimulation equivalence for the abovementioned class.

---