@inproceedings{Litow:AC:1996,
    Abstract = {A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous context-free grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length.},
    Address = {Berlin, Heidelberg},
    Author = {Litow, B.},
    BookTitle = {Algorithms and Computation},
    Editor = {Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash},
    File = {7eb3427b5c295064a1d1ed7426a3bd2cddb0 (0) - a - a - q.pdf},
    ISBN = {978-3-540-49633-5},
    Pages = {239--246},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Bounded length UCFG equivalence},
    Year = {1996},
    date-added = {2018-06-12 05:51:42 +0000},
    date-modified = {2020-06-11 09:01:38 +0200},
    file-2 = {Bounded length UCFG equivalence - Litow1996\_Chapter\_BoundedLengthUCFGEquivalence (0) - a - a - q.pdf},
    doi = {10.1007/BFb0009500}
}

@inproceedings{Litow:AC:1996, Abstract = {A randomised polylog time algorithm is given for deciding whether or not the sets of words of a given length generated by two unambiguous context-free grammars coincide. The algorithm is in randomised NC4 in terms of the product of the grammar size and the length.}, Address = {Berlin, Heidelberg}, Author = {Litow, B.}, BookTitle = {Algorithms and Computation}, Editor = {Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash}, File = {7eb3427b5c295064a1d1ed7426a3bd2cddb0 (0) - a - a - q.pdf}, ISBN = {978-3-540-49633-5}, Pages = {239--246}, Publisher = {Springer Berlin Heidelberg}, Title = {Bounded length UCFG equivalence}, Year = {1996}, date-added = {2018-06-12 05:51:42 +0000}, date-modified = {2020-06-11 09:01:38 +0200}, file-2 = {Bounded length UCFG equivalence - Litow1996_Chapter_BoundedLengthUCFGEquivalence (0) - a - a - q.pdf}, doi = {10.1007/BFb0009500} }