Register

Ace Test Series: Theory Of Computation - Finite Automata

• edited by
374 views
0 votes
0 votes

I do understand that this language is the intersection of the lanuage that starts with 101 and the other where strings are divisible by 100. So we can just concatenate the automata states ..first one has 4 states and the second one has 100..So 104. However cant we fuse the final state of the first with the initial state of the second?..making it 103

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
3 answers
1
Hirak asked May 22, 2019
1,393 views
Ace Test Series: Theory Of Computation - Finite Automata
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language? $4$ $16$ $20$ $24$
How many $2$ state DFA’s with the designated initial state can be constructed over the alphabet over the alphabet $\sum = \{a, b\}$ that accept universal language?$4$$1...
User Avatar
0 votes
0 votes
3 answers
3
Tridhara Chakrabarti asked Jan 3, 2017
799 views
Ace Test Series: Theory Of Computation - Finite Automata
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
Simple question. However the question mention MFA or minimal Finite Automation. So can i take NFA as it has 3 states. DFA has four ( 1 extra for the dead state);
User Avatar
Link Copied!