Model checking rationally restricted right closures of recognizable graphs
Olaf Burkart · Electronic Notes in Theoretical Computer Science · 1997
In this paper we present an elementary model-checking algorithm for the class of infinite transition graphs defined by rationally restricted right closures of recognizable graphs that decides the full modal mu calculus.