Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete | IEEE Conference Publication | IEEE Xplore