Finite State Machine trasition possibilities

Asked Feb 20 '18 at 11:15

Active Feb 20 '18 at 11:15

Viewed 53 times

Im studying finite state machines, in particular the deterministic and the non-deterministic versions.

What i have not understood is :

why in a non-deterministic state machine it's allowed that from a state it's possible to go nowhere ?

This is not allewed in DSM. Why ?

asked Feb 20 '18 at 11:15

Qwerto

It's just a matter of definition. Some people allow there to be no outgoing transitions even in DFAs. It's completely arbitrary. – Yuval Filmus Feb 20 '18 at 11:18
If a NDSM has an equivalent in a DSM, why all the definitions that involves P,NP,ecc.. uses uses the NDSM ? – Qwerto Feb 20 '18 at 11:27
Like Here – Qwerto Feb 20 '18 at 11:28
The definitions of P and NP use Turing machines, not finite state machines. – Yuval Filmus Feb 20 '18 at 11:32
Are connected comcepts ? – Qwerto Feb 20 '18 at 11:48
Perhaps it's best for you to wait until you are taught these concepts in class. – Yuval Filmus Feb 20 '18 at 12:37
I've just studied Deterministic and not deterministic turing machines, but i still dont understand why all the definitions that involves P,NP,ecc speak about the non deterministic turining machine instead of the deterministic one ( that is the only applicable in the real world...) – Qwerto Feb 21 '18 at 11:41
1

Actually P is defined using deterministic Turing machines. NP can also be defined using only deterministic Turing machines (which are given access to a witness which they verify). See our reference question. – Yuval Filmus Feb 21 '18 at 12:35

0 Answers0