The following pages link to (Q3813316):
Displaying 8 items.
- On the equivalence problem of context-free and DT0L languages (Q1961239) (← links)
- The undecidability of proof search when equality is a logical connective (Q2134939) (← links)
- On the decidability of the PVD class with equality (Q2743641) (← links)
- On lindenmayerian rational subsets of monoids (Q4348240) (← links)
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
- (Q4818803) (← links)
- (Q4818813) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)