search

nklopstock611 / turing-machine-interpreter

Interpreter for a little Turing Machine like language.
1 stars 0 forks source link

Language Recognition Functionality #4

Closed nklopstock611 closed 11 months ago

nklopstock611 commented 11 months ago

Add instructions for language recognition, that is, evaluate if some string is part of a language defined by some rules. If the machine ends on a specific position/cell, it accepts the string, otherwise it rejects it.

Example: The language represented by the regular expression (01)∗ is decidable. Decidable means, there is a Turing Machine that can decide if a string is part of said language.

image

Or the classic even number of 0's.

nklopstock611 commented 11 months ago

Just added the example said in this issue. It would be cool to add more!