512 views

1 Answer

0 votes
0 votes
Yes, because like Dfa/nfa...it is not a string accepter...mealy/moore machine just maps an input to a corresponding output, so no terminal state is required...

Related questions

1 votes
1 votes
0 answers
1
rahul sharma 5 asked Nov 11, 2017
1,256 views
The output of moore machine will always have start state output as prefix? True/False?
0 votes
0 votes
0 answers
2
RahulVerma3 asked Apr 2
46 views
Is this the correct Turing machine for the language $0^n 1^n0^n$?assuming $ at the end and begining of the input tape