Aktualności Wydarzenia
Teoria Automatów
Complexity of bisimulation equivalence
Seminarium Teoria Automatów
Prelegent: Slawomir Lasota
2005-11-23 14:15
An overview of known results and open problems in checking bisimulation equivalence on infinite graphs. In particular, graphs generated by context-free grammars and pushdown automata will be considered. Relationship to language equivalence will be pointed out, in particular for deterministic pushdown automata and for so called simple grammars.
2009-12-08
Piotr Hofman