@inproceedings{10.1007/978-3-030-24886-4_15,
    Abstract = {We propose a new algorithm for checking language equivalence of non-deterministic B{\"u}chi automata. We start from a construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem to that of checking equivalence of automata on finite words. Although this construction generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinization or complementation.},
    Address = {Cham},
    Author = {Kuperberg, Denis and Pinault, Laureline and Pous, Damien},
    BookTitle = {Developments in Language Theory},
    Editor = {Hofman, Piotrek and Skrzypczak, Micha{{\l}}},
    File = {Coinductive algorithms for Büchi automata (0) - a - a - x.pdf},
    ISBN = {978-3-030-24886-4},
    Pages = {206--220},
    Publisher = {Springer International Publishing},
    Title = {Coinductive Algorithms for B{\"u}chi Automata},
    Year = {2019},
    date-added = {2019-09-21 12:04:52 +0200},
    date-modified = {2019-09-21 12:04:52 +0200},
    doi = {10.1007/978-3-030-24886-4_15}
}

@inproceedings{10.1007/978-3-030-24886-4_15, Abstract = {We propose a new algorithm for checking language equivalence of non-deterministic B{\"u}chi automata. We start from a construction proposed by Calbrix, Nivat and Podelski, which makes it possible to reduce the problem to that of checking equivalence of automata on finite words. Although this construction generates large and highly non-deterministic automata, we show how to exploit their specific structure and apply state-of-the art techniques based on coinduction to reduce the state-space that has to be explored. Doing so, we obtain algorithms which do not require full determinization or complementation.}, Address = {Cham}, Author = {Kuperberg, Denis and Pinault, Laureline and Pous, Damien}, BookTitle = {Developments in Language Theory}, Editor = {Hofman, Piotrek and Skrzypczak, Micha{{\l}}}, File = {Coinductive algorithms for Büchi automata (0) - a - a - x.pdf}, ISBN = {978-3-030-24886-4}, Pages = {206--220}, Publisher = {Springer International Publishing}, Title = {Coinductive Algorithms for B{\"u}chi Automata}, Year = {2019}, date-added = {2019-09-21 12:04:52 +0200}, date-modified = {2019-09-21 12:04:52 +0200}, doi = {10.1007/978-3-030-24886-4_15} }