English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper the computational complexity of the (bi)simulation problem overrestricted graph classes is studied. For trees given as pointer structures orterms the (bi)simulation problem is complete for logarithmic space or NC$^1$,respectively. This solves an open problem from Balc\'azar, Gabarr\'o, andS\'antha. Furthermore, if only one of the input graphs is required to be atree, the bisimulation (simulation) problem is contained in AC$^1$ (LogCFL). Incontrast, it is also shown that the simulation problem is P-complete alreadyfor graphs of bounded path-width.

The Complexity of Bisimulation and Simulation on Finite Systems