Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

Why are NFA and DFA placed in the first chapter in this book? Whether NFA and DFA have equivalence ability to Turing Machine, so does computer?

April 26, 2017ability book Chapter Computer dfa equivalence Machine nfa Placed turing

0

0 Posted

Why are NFA and DFA placed in the first chapter in this book? Whether NFA and DFA have equivalence ability to Turing Machine, so does computer?

1 Answer

0

0 Posted

Of course they are not equivalent. We start with FA because they are the most primitive machines, and all other machines build on them. For example, a Turing machine is a FA plus an infinite memory tape.