CODEWITHSUNDEEP
turing-machines
blackilDiamond
blackilDiamond

Reputation: 13

Why lambda Transitions are not in Turing Machine?

Lambda Transition are not defined in Turing machines? What is the reason for that? Someone please explain me.

Thanks in advance.

Upvotes: 1

Views: 1897

Answers (1)

Ken Cheung
Ken Cheung

Reputation: 1808

Hope my memory from 20 years ago still valid, please correct if any mistake!

Are you talking about the lambda transition in NFA? Lambda transition in NFA is mainly to simplify the complexity of FA only. You should also learn how to convert NFA to DFA s.t. it is deterministic and a "machine" is capable to "execute" it step by step to process its reflecting formal language.

Turing Machine is an abstract machine under Turing theory, and most of the nowadays computers' model (except quantum computers, which is still rare in our world). In my understanding Turing Machine is deterministic and executing over the tap to perform a "computation". There's no non-deterministic element inside.

Upvotes: 0

Related Questions