Section outline
-
1. Regular Language to Regular Expression
2. Regular Expression to string generation
3. Regular Expression to Finite Automata
4. DFA to Regular Expression
-
Opens: Monday, 6 April 2026, 8:10 PMDue: Monday, 6 April 2026, 8:50 PM
-
Opens: Wednesday, 8 April 2026, 1:02 PMDue: Wednesday, 8 April 2026, 1:52 PM
-
Opens: Wednesday, 8 April 2026, 1:02 PMDue: Friday, 1 May 2026, 1:52 PM
-
Students mustMark as done
-
Opened: Wednesday, 20 November 2024, 3:00 PMDue: Wednesday, 20 November 2024, 4:30 PMStudents mustMark as done
Submit your class work here
-
Opened: Monday, 7 April 2025, 12:00 AMDue: Monday, 7 April 2025, 12:00 AMStudents mustMark as done
Submit your class work here
Deadline: 25/09/2023
Time: 2:45 PM
-
Opened: Monday, 7 April 2025, 12:00 AMDue: Monday, 7 April 2025, 12:00 AMStudents mustMark as done
Submit your class work here.
Submission deadline: 25th September, 2023
-
Opened: Tuesday, 8 April 2025, 12:00 AMDue: Wednesday, 9 April 2025, 12:00 AMStudents mustMark as done
Find out e-NFA for the following expressions:
1. (0 + 10*)
2. (0*10*)
3. (0 + E) (1 +E) [E is epsilon]
Convert the provided DFA from slide to RE. Follow the order 2,1,3
Write down your id in top of every page.
Submission deadline: Today’s class
-
Opened: Wednesday, 9 April 2025, 12:00 AMDue: Thursday, 10 April 2025, 12:00 AMStudents mustMark as done
Submit your class work here
-
Opened: Sunday, 13 April 2025, 12:00 AMDue: Monday, 14 April 2025, 12:00 AMStudents mustMark as done
Submit your class work here.
-
Due: Friday, 27 September 2024, 1:30 AMStudents mustMark as done
Find out the "Regular Expression" for the following simple regular language where input alphabet is {0, 1} :
a) {w| w where each string has even length}
b) {w| w where each string has even length}
c) {w| w where each string has length 3}