Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete

Petr Jancar, Sylvain Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. pages 1-12, IEEE, 2019. [doi]

Abstract

Abstract is missing.