Agrawal, Manindra ; Venkatesh, S. (1996) On the isomorphism conjecture for 2DFA reductions International Journal of Foundations of Computer Science, 7 (4). pp. 339-352. ISSN 0129-0541
|
PDF
- Author Version
203kB |
Official URL: http://ejournals.worldscientific.com.sg/ijfcs/07/0...
Related URL: http://dx.doi.org/10.1142/S0129054196000245
Abstract
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for any class C that is closed under log-lin reductions: All complete sets for the class C under 2DFA reductions are also complete under one-one, length-increasing 2DFA reductions and are first-order isomorphic. The 2DFA-isomorphism conjecture is false, i.e., the complete sets under 2DFA reductions are not isomorphic to each other via 2DFA reductions.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to World Scientific Publishing Company. |
Keywords: | Isomorphism; Completeness; Reducibility; Computational Complexity |
ID Code: | 92026 |
Deposited On: | 26 May 2012 13:52 |
Last Modified: | 19 May 2016 05:37 |
Repository Staff Only: item control page