Identification of Language Class Using Dovetailing
The method of dovetailing can be beneficial in identifying a given language class. Let us consider the following language L = {<M> | M is a Turing machine and M accepts at least one string from Σ*} using the above example of dovetailing we know that M always halts so the Turing Machine for L will also stop for all of its member strings. In the case of the non-members M may or may not halt. So L is recognizable but not decidable, so L is a Recursively Enumerable language.
Dovetailing in Turing Machines
In the carpentry industry, dovetailing is a technique of joining two pieces of wood together by interleaving them. Similarly in the case of Turing Machines dovetailing is the technique by which we can simulate multiple Turing Machines, in some cases an infinite number of Turing Machines together.
This technique can be very useful in determining the decidability and recognizability of some Turing Machines or languages related to Turing Machines.