00:01
Okay, so i see that you need help with these questions, and it wants to know which of these statements are correct.
00:07
So for number one, the first one is correct.
00:13
If an efficient solution for an np complete problem is found on the deterministic turning machine, it would imply that p equals np as it would show that all np problems can be solved in polynomial time.
00:30
Number two is correct.
00:34
In linear bound automa, the tape is limited to the size of the input, which means that the head of the turning machine cannot move beyond the input part of the tape.
00:44
Number three is correct.
00:50
Both fsm, finite state machine, and fsa, finite state automation, refer to the same concept, which is mathematical model used to describe computation.
01:03
Number four is correct.
01:10
In regular expressions, the star and the union operators have higher precedence than the concentration operator, meaning they are evaluated first.
01:28
The next one is also correct.
01:31
The turning machine is a computational model that can simulate any computer algorithm, making it a universal model for computation...