The　computational　capabilities　inherent　in　the　hybridization　of　DNA　molecules　were　examined.　First,　based　on　the　Winfree＇s　previous　work　which　demonstrated　the　self-assembly　of　linear　molecules　could　generate　only　regular　language,　it　was　proven　that　the　linear　self-assembly　can　also　generate　linear　languages,　by　hybridizing　the　linear　molecules　which　respectively　represent　the　left　and　right　linear　derivations.　Then　a　new　way　was　defined　to　prove　that　the　unique　set　of　sequences　equivalent　to　context-free　languages　can　be　obtained　by　mixed　self-assembly　of　molecules　with　1-,　2-,　3-sticky　ends,　which　is　a　supplement　for　Winfree＇s　theory　that　the　self-assembly　of　dendrimer　nanostructures　is　equivalent　to　context-free　language.