Section outline
-
Learning objective:
1) To know about DFA Construction
Learning Outcome:
1) Can construct DFA from any given regular language
Content:
1) Problem solving from DFA Construction
-
Opened: Wednesday, 25 December 2024, 12:00 AMDue: Thursday, 26 December 2024, 12:00 AMStudents mustViewMake a submission
Construct DFA for the following language. Consider Σ = {0,1} for every language.
- {w | the length of w is exactly 5}
- {w | the length of w is maximum 5}
- {w | the length of w is minimum 5}
- {w | w where |w| mod 4=0}
- {w | w where |w| mod 4=1}
- {w | w where |w| mod 4=2}
- {w | w where |w| mod 4=3}
- {w | the length of w is exactly 5}
-
Opened: Saturday, 31 August 2024, 2:00 PMDue: Saturday, 31 August 2024, 5:30 PM
Construct DFA for the following language. Consider Σ = {0,1} for every language.
- {w | the length of w is exactly 5}
- {w | the length of w is maximum 5}
- {w | the length of w is minimum 5}
- {w | w where |w| mod 4=0}
- {w | w where |w| mod 4=1}
- {w | w where |w| mod 4=2}
- {w | w where |w| mod 4=3}
- {w | the length of w is exactly 5}
-
Chapter 1
Page: 84
Problem Number: 1.5, 1.6
-
Opened: Monday, 30 December 2024, 1:00 PMDue: Monday, 30 December 2024, 4:00 PMStudents mustViewMake a submission
1. {w|w where string starts with ba}
2. {w|w where string does contains 0101 as substring}
3. {w|w string start with b and ends with ab}
4. {w| na(w) mod 4=2}
5. {w|w where every b should never followed by a}
-
Students mustMark as done
-
Opened: Tuesday, 17 September 2024, 12:00 AMDue: Tuesday, 24 September 2024, 12:00 AMStudents mustMark as done