project 3

docx

School

Portland Community College *

*We aren’t endorsed by this school

Course

464

Subject

Computer Science

Date

Nov 24, 2024

Type

docx

Pages

3

Uploaded by ProfessorIceCat10

Report
Project 3 For each automaton, "submit" a JFLAP file(.jff file) of the automaton and a screenshot of some test cases for it, test cases should include strings in the language(Accept) and strings not in the language (Reject). All your solutions should be submitted as two attachments in the below format. 1. PDF file with all the written explanations answers + screenshot of test cases (if JFLAP is applicable for the question) 2. ZIP all the JFLAP files(.jff files) in the assignment as one ZIP file (do not submit a rar file) (If JFLAP is not required for a particular assignment, then submit the written explanations as a PDF file only). Section 3.1 1) Create an nfa for Σ = {a, b} that accepts the language L(ab* + (ab)*). 2) Create a regular expression for the set of all strings that consist of an even number of 'a's followed by 'b' (for example "aab", "aaaab", "aaaaaab", etc.). Section 3.2 3) Use the construction in Theorem 3.1 to create an nfa that accepts the language L(bb* + aba). 4) Create a regular expression for the language accepted by the following nfa: states: {q0,q1,q2,q3} input alphabet: {a,b} initial state: q0 final states: {q2} transitions: δ(q3,b) = {q2} δ(q1,b) = {q1} δ(q1,λ) = {q2} δ(q1,a) = {q2} δ(q0,b) = {q3,q1} Section 3.3 5) Create an nfa for Σ = {a, b} that accepts the language generated by the following right-linear grammar:
S -> abbA|baB A -> aba|a B -> bB|b 6) Construct a right-linear grammar for the language L((a + b)*).
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help