19 citations · 53 across the 15 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.FL2014★ 7 cited
A Characterization for Decidable Separability by Piecewise Testable Languages
Wojciech Czerwiński, Wim Martens, Lorijn van Rooijen +2
The separability problem for word languages of a class by languages of a class asks, for two given languages and from , whether the…
cs.LO2014★ 2 cited
Branching Bisimilarity of Normed BPA Processes is in NEXPTIME
Wojciech Czerwiński, Petr Jančar
Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a si…