@inproceedings{10.1007/11821069_56,
    Abstract = {The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n13) time. We give an alternative algorithm working in {\$}O(n^8 {\{}{\backslash}sl polylog{\}} n){\$}time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from {\$}O(n^7 {\{}{\backslash}sl polylog{\}} n){\$}to {\$}O(n^6 {\{}{\backslash}sl polylog{\}} n){\$}.},
    Address = {Berlin, Heidelberg},
    Author = {Lasota, S{{\l}}awomir and Rytter, Wojciech},
    BookTitle = {Mathematical Foundations of Computer Science 2006},
    Editor = {Kr{\'a}lovi{\v{c}}, Rastislav and Urzyczyn, Pawe{{\l}}},
    File = {Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes - 11821069\_56.pdf},
    ISBN = {978-3-540-37793-1},
    Pages = {646--657},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes},
    Year = {2006},
    date-added = {2023-08-09 13:55:22 +0200},
    date-modified = {2023-08-09 13:55:22 +0200},
    doi = {10.1007/11821069_56}
}

@inproceedings{10.1007/11821069_56, Abstract = {The fastest known algorithm for checking bisimulation equivalence of normed context-free processes worked in O(n13) time. We give an alternative algorithm working in {\$}O(n^8 {{}{\backslash}sl polylog{}} n){\$}time, As a side effect we improve the best known upper bound for testing equivalence of simple context-free grammars from {\$}O(n^7 {{}{\backslash}sl polylog{}} n){\$}to {\$}O(n^6 {{}{\backslash}sl polylog{}} n){\$}.}, Address = {Berlin, Heidelberg}, Author = {Lasota, S{{\l}}awomir and Rytter, Wojciech}, BookTitle = {Mathematical Foundations of Computer Science 2006}, Editor = {Kr{\'a}lovi{\v{c}}, Rastislav and Urzyczyn, Pawe{{\l}}}, File = {Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes - 11821069_56.pdf}, ISBN = {978-3-540-37793-1}, Pages = {646--657}, Publisher = {Springer Berlin Heidelberg}, Title = {Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes}, Year = {2006}, date-added = {2023-08-09 13:55:22 +0200}, date-modified = {2023-08-09 13:55:22 +0200}, doi = {10.1007/11821069_56} }