• recategorized by
294 views
0 0 votes
In certain programming languages, comments appear between delimiters such as  (* and  ) .

Let C be the language of all valid delimited comment strings. Such a string in C must begin with ( and end with *)  but have no intervening *) .

For simplicity, assume the alphabet  = {a, b, (, *)}.  

(a)    Provide an NFA that recognizes language C .  

(b)    Present a regular expression that generates  C.

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
0 0 answers
522
522 views
Talha Riaz asked Mar 23, 2024
522 views
1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}: a. All strings that do not end with aa. b. All strings that contain an...
2 2 votes
0 0 answers
874
874 views
1 1 vote
0 0 answers
3.7k
3.7k views
sripo asked Oct 16, 2018
3,680 views
Let l={ (ap )* | p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language.This is a question from a test series,I just want ...