In this paper, a DNA based computing model for solving the star coloring problem is proposed. This model shows how to use DNA strands to construct solution space of molecules for the star coloring problem and how to apply the DNA algorithm to solve the star coloring problem using biological operations. The algorithm is highly parallel and has satisfactory fidelity. The time complexity of the algorithm is O (n 2 ), where n is the number of vertices of the graph.

No abstract

This paper investigates the state complexity of combined operations on regular languages. In particular it investigates the state complexity of shuffle of complement and the intersection of complement of two regular languages represented by alternating finite automata.

No abstract