Evènement pour le groupe
Graphes et Logique
Date | 2011-01-18 11:00-12:00 |
Titre | A Novel Presentation of the Decidability of Language Equivalence on Deterministic Pushdown Automata |
Résumé | The aim of the talk is to present the main ideas of a novel presentation of the decidability of language equivalence on deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling derived a primitive recursive complexity upper bound. The new presentation is based on a reduction to trace equivalence of deterministic first order grammars; this can be also viewed as a problem in term rewriting systems. |
Lieu | salle 76 |
Orateur | Petr Jancar |
Email | petr.jancar@vsb.cz |
Url | Center of Applied Cybernetics |
Aucun document lié à cet événement.
RetourRetour à l'index