Regular

Question 1

• Given DFA, prove that L(A)=L:
  
  • Exams: 20-02-17, 21-01-25,
  • PDF: 1.1,
  • Slides: 2.30,

Answer 1

….

Question 2

• Given Language, construct NFA, then transform NFA to DFA.
  
  • PDF: 1.3,
  • Slide: 02.50, 02.55,
  • Book: section 2.3

Answer 2

….

Question 3

• Given language tell if it’s Regular (pumping)
  
  • Exams: 19-01-22, 19-06-28, 19-09-13, 20-02-17, 21-02-12, 21-09-03,
  • PDF: 1.4, 1.6
  • Slides: 04.16,

Answer 3

…..

Question 4

• Convert FA in Regular Expression:
  
  • Exams: 19-01-22, 21-02-12,
  • Slides: 03.28,
  • Book: section 3.2

Answer 4

….

Question 5

• Convert Regular Expression in e-NFA:
  
  • Exams: 19-06-28, 21-09-03,
  • Book: section 3.2

Answer 5

….

Question 6

• Given generic L1 and L2, tell if intersection/concatenation/… is regular/not regular
  
  • Slide 4.31,

Answer 6

….

Question 7

• Given DFA, apply Tabular algorithm states equivalence and reduce to its minimum (19-02-13, 21-01-25,

Answer 7

….

Question 8

Theory:

Specify the construction developed in class for transforming a NFA N into a DFA D equivalent to N.

Subset construction. Proof L(DFA)=L(NFA). 19-09-13, 20-01-27, 21-06-28,

Answer 8

….

Question 9

• Theory:
  
  • Definition of equivalent pair states of a DFA (21-01-25,

Answer 9

…..

Question 10

• Theory:
  
  • Provide the mathematical definition of language L*. Provide a rigorous proof that (L*)* = L*. (21-06-28, slides 03.38,

Answer 10

…..