Scribd
Upload
6 views3 pages

Assignment T1 2310-2023

The TIC 2151 Theory of Computation assignment requires groups of 3-4 students to develop a web application using HTML, with a due date of January 21, 2024. The application must convert regular grammars into NFA and vice versa, including specific functions for testing strings and drawing NFAs. Submission must include documentation and adhere to strict guidelines, with penalties for late submissions and absences during presentations.

Uploaded by

Mohamad Haikal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Assignment T1 2310-2023

The TIC 2151 Theory of Computation assignment requires groups of 3-4 students to develop a web application using HTML, with a due date of January 21, 2024. The application must convert regular grammars into NFA and vice versa, including specific functions for testing strings and drawing NFAs. Submission must include documentation and adhere to strict guidelines, with penalties for late submissions and absences during presentations.

Uploaded by

Mohamad Haikal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

TIC 2151 Theory of Computation

Assignment (20 marks)


● This is a group assignment. MUST have 3 - 4 students in a group.

● All members MUST be from the same Tutorial group.

● One of the group members MUST be assigned as a leader to manage the work and report
participation percentages of each member.
● The due date for the assignment is on 21 .01. 2024, by 11.59 PM.

● You MUST submit your assignment in softcopy (App + Documentation).

● For this assignment you MUST develop web application using HTML (can include
JavaScript)
● Using different programming languages such as C++, Java or VB will result in ZERO
mark.
● Late Submission: 5 marks will be deducted per day.

● Absent for presentation: result in ZERO mark for the whole project.

Implement ONE application with the following functions


1. Convert Regular grammars into NFA (as a formal definition with transition table)
Includes the following sub functions
a. Testing strings (up to 5 strings at once) a statement to inform user whether each
string can be generated by the RG.
b. Convert ε-NFA into an NFA without ε-transitions (if any)
c. Draw the NFA (optional)
2. Convert NFA (transition table) into Regular grammars
Includes the following sub functions
a. Testing strings (up to 5 strings at once) a statement to inform user whether each
string is accepted or rejected NFA.
b. Draw the NFA (optional)

Important: Final App must look like the examples below : ONE application with
one Main HTML file to start with. POP-UPS SCREENS AND MESSAGES ARE NOT
ALLOWED .

Example :
TIC 2151 Theory of Computation
TIC 2151 Theory of Computation

Your submitted project must include a Main file (main.html) to start with, main page must
not be used to run other programs or take the user to another page, everything must be
displayed within the main page.

Marks Distribution
Design 10 %
Functions: 60 %
Documentation + Presentation : 30 %

Documents must include:


1. Cover page
2. Members and their participation percentages
3. Introduction
4. Design Flowcharts ,
5. 4 screenshots
6. Manual with examples
7. limitations
8. Important codes

You might also like