| | |
Summary: International Journal of Foundations of Computer Science
c World Scientific Publishing Company
ON THE ISOMORPHISM CONJECTURE FOR 2-DFA
REDUCTIONS
MANINDRA AGRAWAL
Department of Computer Science and Engineering, Indian Institute of Technology
Kanpur 208016, India
and
S. VENKATESH
Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Colaba
Bombay 400005, India
Received 4 January 1995
Revised October 3, 2006
Communicated by J. Y. Cai
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
|
