Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Petr Jancar. Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. J. Comput. Syst. Sci., 109:22-44, 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation EquivalencePetr Jancar. mfcs 2016: [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]
The following publications are possibly variants of this publication: