@article{Seidl:SIAM:1990,
    Author = {Seidl, Helmut},
    EPrint = {https://doi.org/10.1137/0219027},
    File = {Seidl90Deciding (0) - a - a - d.pdf},
    Journal = {SIAM Journal on Computing},
    Number = {3},
    Pages = {424--437},
    Title = {Deciding Equivalence of Finite Tree Automata},
    URL = {https://doi.org/10.1137/0219027},
    Volume = {19},
    Year = {1990},
    bdsk-url-1 = {https://doi.org/10.1137/0219027},
    date-added = {2018-10-03 06:57:10 +0000},
    date-modified = {2023-10-02 07:50:19 +0200},
    file-2 = {Deciding Equivalence of Finite Tree Automata - seidl1990 - a.pdf},
    doi = {10.1137/0219027}
}

@article{Seidl:SIAM:1990, Author = {Seidl, Helmut}, EPrint = {https://doi.org/10.1137/0219027}, File = {Seidl90Deciding (0) - a - a - d.pdf}, Journal = {SIAM Journal on Computing}, Number = {3}, Pages = {424--437}, Title = {Deciding Equivalence of Finite Tree Automata}, URL = {https://doi.org/10.1137/0219027}, Volume = {19}, Year = {1990}, bdsk-url-1 = {https://doi.org/10.1137/0219027}, date-added = {2018-10-03 06:57:10 +0000}, date-modified = {2023-10-02 07:50:19 +0200}, file-2 = {Deciding Equivalence of Finite Tree Automata - seidl1990 - a.pdf}, doi = {10.1137/0219027} }