DLT 2010
 |  |
Wall of Fame | Most Viewed DLT-2010 Paper
DLT
2010
13 years 6 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...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 166 | ||
| 2 | | 166 | ||
| 3 | | 164 | ||
| 4 | | 164 | ||
| 5 | | 162 | ||
| 6 | | 160 | ||
| 7 | | 153 | ||
| 8 | | 151 | ||
| 9 | | 148 | ||
| 10 | | 144 | ||
| 11 | | 139 | ||
| 12 | | 138 | ||
| 13 | | 134 |