Fibonacci string has been widely used as object of combinatorial studies by researchers. This research discusses some aspects of combinatorial Tribonacci strings, beginning with enumerating aspects that define the relationship between the length of the Tribonacci string (|t|) and the number of Tribonacci strings with length (|Tn|), where t Є Tn. These results are formulated in the form of recurrence relations. The next aspect is the generation to develop a formulation of recurrence relation generating Tribonacci string following lexicographical order, and identify some properties of this relation. On the enumeration aspect, the recurrence relation that describes the relationship between the number of Tribonacci strings and Tribonacci string length is generated. On the generation aspect, the recurrence relation to generate the Tribonacci string according to lexicographical order is formed. Specifically, results from the generation aspect is very useful as a basis for the formation of Gray codes and give variation to the theory of coding.