About CS402 Assignment 1
CS402 Assignment No 1 for Fall 2026 is from Theory of Automata. It covers lesson 10: Nondeterminism and Kleene’s Theorem, carries 20 marks and closed on VULMS on Tuesday 17 November 2026. The solution is on this page, with the assignment file.
- Course
- CS402 Theory of Automata
- Assignment
- Assignment No 1
- Semester
- Fall 2026
- Lesson
- 10: Nondeterminism and Kleene’s Theorem
- Total marks
- 20
- End date
- Tue 17 Nov, 11:59 pm
What CS402 Assignment 1 asks
This assignment covers fundamental concepts in the theory of automata, including string manipulation, regular expressions, and finite automata. Students will work with specific languages defined over given alphabets to demonstrate their understanding of formal language theory. The tasks require tokenizing strings, constructing regular expressions, and designing minimal finite automata and transition graphs. Students must produce formal representations for these languages based on the provided constraints.
-
1
Question No 01
05 marksFor the two provided strings, determine the length over the specified alphabet by performing tokenization. You must complete the table by filling in the tokenization and the resulting length for each string. Ensure the tokens match the provided alphabet sets exactly.
-
2
Question No 02
05 marksDefine a regular expression for the language L1 over the alphabet {a, b}. The language consists of strings that contain exactly one 'b' and must begin and end with at least one 'a'.
-
3
Question No 03
05 marksDraw a minimal Finite Automaton (FA) for the language L2 over the alphabet {a, b}. The language includes strings where every occurrence of the substring 'aa' is immediately followed by a 'b'. You may use software tools like JFLAP to create the diagram.
-
4
Question No 04
05 marksDraw a minimal Transition Graph (TG) for the language L3 over the alphabet {0, 1}. The language consists of all strings that do not contain the substring '00'.
- What to submit
- One Doc or Docx file.
- Topics covered
- Alphabets and strings String tokenization Regular expressions Finite Automata Transition graphs Formal languages
A summary of the assignment file, Fall 2026_CS402_1.docx. Download the file for the full wording before you start.
Lesson covered
The questions in this assignment come from this lesson. Read it in the CS402 handout before you open the assignment file, then practise it with the MCQs and past papers.
Solution
The solution for CS402 Assignment No 1 was added on 16 Nov 2026. It answers the questions in the assignment file, Fall 2026_CS402_1.docx.
Before you submit on VULMS
- 1 Solve the questions in the assignment file yourself first, then use the solution to check your method and answers.
- 2 Write the final answer in your own words. VU checks assignments for copying, and copied work gets zero marks.
- 3 Save your answer in the file type the assignment file asks for, and name it with your student ID, for example BC260012345.
- 4 Open the file once more to check it is not empty or corrupted, then upload it on VULMS before 11:59 pm on Tue 17 Nov.
Questions about this assignment
When is CS402 Assignment 1 due?
It closed on Tuesday 17 November 2026. VULMS no longer accepts files for it, but the assignment stays here for revision.
Is the CS402 Assignment 1 solution free?
The assignment file is free with no limit. The solution counts toward your daily downloads: 3 a day on the web, 30 a day with the free Chrome extension, 100 a day with Pro Semester and unlimited in the Android app.
Can I submit the solution as it is?
No. VU checks assignments for copying, and copied work gets zero marks. Use the solution to check your method, then write your own answer.
What file do I submit?
The assignment file says which file type to upload and lists any extra instructions from your instructor. Name the file with your student ID before you upload it on VULMS.