The Gateway to Computer Science Excellence
0 votes
19 views
. Construct the minimal finite automata that accept all the strings of 0’s and 1’s where the integer equivalent of the binary string is congruent to 3 mod 6. What is the no. of states in the minimal finite automata?
in Theory of Computation by (445 points) | 19 views
0
Number of states needed in minimal finite automata is= 6/2 (1 state) +3= 4 states

What is the answer?

1 Answer

+1 vote
no of states in minimal finite automata =4

here it is mod 6= 6/2=3

here no of states = 3+1
by (349 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,357 answers
198,483 comments
105,256 users