546 search results - page 110 / 110 » Extended Null-Move Reductions |
155
Voted
DLT
2010
15 years 4 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...