90 search results - page 3 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
RTA
1998
Springer
13 years 11 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
FSTTCS
2004
Springer
14 years 28 days ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
PARLE
1987
13 years 11 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
PODS
1992
ACM
13 years 11 months ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...