346 views
1 votes
1 votes
Find minimized finite automata which recognizes the below languages, separately by m1 and
m2 over binary strings as input, then find the number of states in each of the following.
L1:L2 is a language, which contains a set of strings which produces a remainder ‘1’, when its
equivalent value is divisible by ‘4’.
L2:L1 is a language it contains a set of strings which are starting with 1010 and the length of the
string is divisible by 4.
(a) m1 contains 4 states and m2 contains 7 states
(b) m1 contains 4 states and m2 contains 8 states
(c) m1 contains 3 states and m2 contains 9 states
(d) m1 contains 4 states and m2 contains 9 states

1 Answer

Related questions

0 votes
0 votes
0 answers
1
Na462 asked Sep 29, 2018
1,405 views
0 votes
0 votes
1 answer
2
srestha asked Aug 26, 2018
4,519 views
The sum of product (SOP) form of logic expression is most suitable for designing logic circuit using onlyA) NAND gateB)NOR gate
0 votes
0 votes
0 answers
3
Lakshman Bhaiya asked Aug 23, 2018
475 views
Q) In a K-map it was found out that Essential Prime Implicants are covering all terms except 2 min terms.Those 2 min terms are in turn covered by 3 Non-essential Prime Im...
0 votes
0 votes
1 answer
4
Çșȇ ʛấẗẻ asked Sep 14, 2023
109 views