- #1
physicsuser
- 82
- 1
Sorry if this is a wrong place to post this.
What does it mean that a turing machine M recognize language A?
Does it mean that A={w|M accepts w}? Is so then how does M accept w? Does it accept w if it ends in accept state?
What does it mean that a turing machine M recognize language A?
Does it mean that A={w|M accepts w}? Is so then how does M accept w? Does it accept w if it ends in accept state?