Bisimulation equivalence of first-order grammars is ACKERMANN-complete

DOI10.5555/3470152.3470209MaRDI QIDQ6654522zbMATH OpenFDO

Authors Petr Jančar, Sylvain Schmitz

Publication date 19 December 2024

zbMATH Keywords

pushdown systembisimilarityfirst-order grammarfast-growing complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Bisimulation equivalence of first-order grammars is ACKERMANN-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654522)