Concatenation of DFA1 with DFA2:
Transition Table of DFA1.DFA2:
Resulting DFA (DFA1.DFA2):
Do comment and support us Thanks ☺️.
For assignments and quizzes do contact us:
Mail: rali94072@gmail.com
L1 is a language defined over {0,1} such that if starts with 0, length is odd. But if starts with 1, string should have even number of zeros. Write Regular Expression and make DFA.
Here is DFA of a language:
Above DFA is accepting all the strings that if starts with '0' have odd length but if starts with '1' they must have even number of zeros.
Regular Expression:
State Transition Table:
For assignments and quizzes do contact us:
Mail: rali94072@gmail.com
Subscribe to:
Posts (Atom)
