3 citations · 5 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Equivalence of pushdown automata via first-order grammars
Petr Jancar
A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by Sénizergues (1998, 2005) that subsumes his affirmativ…
cs.LO2018★ 1 cited
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets
Petr Jancar, Petr Osicka, Zdenek Sawa
We note that the remarkable EXPSPACE-hardness result in [Göller, Haase, Ouaknine, Worrell, ICALP 2010] ([GHOW10] for short) allows us to answer an open complexity question for simu…