The following publications are possibly variants of this publication:
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalencePetr Jancar. jcss, 109:22-44, 2020. [doi]
- Deciding Bisimulation-Like Equivalences with Finite-State ProcessesPetr Jancar, Antonín Kucera, Richard Mayr. icalp 1998: 200-211 [doi]
- Deciding bisimulation-like equivalences with finite-state processesPetr Jancar, Antonín Kucera, Richard Mayr. TCS, 258(1-2):409-433, 2001. [doi]
- Bisimulation Equivalence of First-Order GrammarsPetr Jancar. icalp 2014: 232-243 [doi]
- Equivalence of pushdown automata via first-order grammarsPetr Jancar. jcss, 115:86-112, 2021. [doi]
- Bisimulation Equivalence of First-Order Grammars is ACKERMANN-CompletePetr Jancar, Sylvain Schmitz. lics 2019: 1-12 [doi]