Nie jesteś zalogowany |
Bisimulation equivalence and commutative context-free grammars
- Prelegent(ci)
- Sławomir Lasota
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 20 grudnia 2006 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
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.
