1 votes 1 votes Consider the above turing machine ,which is accepting ab(a)* strings.What will happen if anything comes at state h?h is the final state here.Will it halt and halt in final is accepted? Theory of Computation theory-of-computation + – rahul sharma 5 asked Aug 8, 2017 rahul sharma 5 194 views answer comment Share Follow See 1 comment See all 1 1 comment reply stblue commented Aug 9, 2017 reply Follow Share If string is in the language, then machine will halt in final state, if string is not in the language then it will halt in non final state. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Hello sir, turing machine will only end up in H if the input string has been processed completely. So , you will not have any input left after you reach h. Thanks. Karan Saini answered Aug 9, 2017 Karan Saini comment Share Follow See all 0 reply Please log in or register to add a comment.