Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete

Résumé

Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by Sénizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent setting of first-order grammars. This ACKERMANN upper bound is optimal, and we also show that strong bisimilarity is primitive-recursive when the number of states of the automata is fixed.

Dates et versions

hal-02267529 , version 1 (19-08-2019)

Identifiants

Citer

Petr Jancar, Sylvain Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. LICS 2019, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2019, Vancouver, Canada. pp.1--12, ⟨10.1109/LICS.2019.8785848⟩. ⟨hal-02267529⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More