A turing machine is more powerful than finite state machine because
Answers
Answered by
0
✔✔✔✔Ur answer✔✔✔✔
✔✔✔✔But only a ✔Turning machine✔ can recognise a sequence that has an arbitrary number of As followed by the same number of Bs.✔✔
⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐
✔✔✔✔That is a Turing machine is more powerful than a finite state machine because it can count.☺☺☺☺☺
✔✔✔✔But only a ✔Turning machine✔ can recognise a sequence that has an arbitrary number of As followed by the same number of Bs.✔✔
⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐⭐
✔✔✔✔That is a Turing machine is more powerful than a finite state machine because it can count.☺☺☺☺☺
Similar questions