Weak bisimilarity and regularity of context-free processes is EXPTIME-hard

Richard Mayr. Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. Theoretical Computer Science, 330(3):553-575, 2005. [doi]

Abstract

Abstract is missing.