@article{Jancar:JCSS:2021,
    Abstract = {A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S{\'e}nizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis.},
    Author = {Jan{\v c}ar, Petr},
    File = {Equivalence of pushdown automata via first-order grammars - 1-s2.0-S0022000020300714-main.pdf},
    ISSN = {0022-0000},
    Journal = {Journal of Computer and System Sciences},
    Keywords = {Pushdown automata, First-order grammars, Bisimulation equivalence},
    Pages = {86--112},
    Title = {Equivalence of pushdown automata via first-order grammars},
    URL = {https://www.sciencedirect.com/science/article/pii/S0022000020300714},
    Volume = {115},
    Year = {2021},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0022000020300714},
    bdsk-url-2 = {https://doi.org/10.1016/j.jcss.2020.07.004},
    date-added = {2023-08-10 11:44:07 +0200},
    date-modified = {2023-08-10 11:44:27 +0200},
    doi = {10.1016/j.jcss.2020.07.004}
}

@article{Jancar:JCSS:2021, Abstract = {A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S{\'e}nizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for deterministic pushdown automata. The presented proof is conceptually simpler, and a particular novelty is that it is not given as two semidecision procedures but it provides an explicit algorithm that might be amenable to a complexity analysis.}, Author = {Jan{\v c}ar, Petr}, File = {Equivalence of pushdown automata via first-order grammars - 1-s2.0-S0022000020300714-main.pdf}, ISSN = {0022-0000}, Journal = {Journal of Computer and System Sciences}, Keywords = {Pushdown automata, First-order grammars, Bisimulation equivalence}, Pages = {86--112}, Title = {Equivalence of pushdown automata via first-order grammars}, URL = {https://www.sciencedirect.com/science/article/pii/S0022000020300714}, Volume = {115}, Year = {2021}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0022000020300714}, bdsk-url-2 = {https://doi.org/10.1016/j.jcss.2020.07.004}, date-added = {2023-08-10 11:44:07 +0200}, date-modified = {2023-08-10 11:44:27 +0200}, doi = {10.1016/j.jcss.2020.07.004} }