Thursday, 15 January 2015

Turing Machine that recognises a set language

A Turing Machine is a theoretical machine that performs computation using a strip of tape conferring to some predefined rules. In other words a Turing Machine can be described as a piece of software built to perform a set of predefined rules. There are different types of Turing Machines for different purposes namely 2 tape, Multiple-tape and Universal Turing Machines. This blog post gives an example of a Turing Machine that recognises the set language {an bm cn+m | n, m ≥ 0}.

No comments:

Post a Comment