Languages and Finite Automata - WPI

Take a recursively enumerable language Decision problems: All these problems are undecidable Theorem: For a recursively enumerable language it is undecidable to determine whether contains two different strings of same length Proof: We will reduce the halting problem to this...

Author:
Uploaded by: Murkka Svensdottir
Filesize: 233 KB