Register

ullman chapter regular expressions and languages exercise 3.1

484 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · Digital topic test
← Previous in category · TOCCCNext in category → · theory of computatio...
Position:
Show:

Related questions

2 2 votes
1 1 answer
1.7k
1.7k views
Ayush Upadhyaya asked Mar 10, 2017
1,723 views
Peter Linz-Chapter 3.1 Regular Expressions
Give a regular expression for the language over {0,1}NOT CONTAINING 101 AS SUBSTRING.
0 0 votes
2 2 answers
1.1k
1.1k views
Ayush Upadhyaya asked Mar 9, 2017
1,117 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for all strings over {0,1) not ending in 01.
0 0 votes
2 2 answers
3.7k
3.7k views
Ayush Upadhyaya asked Mar 9, 2017
3,679 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
0 0 votes
2 2 answers
1.0k
1.0k views
Ayush Upadhyaya asked Mar 9, 2017
1,011 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for the complement of the languageL = { an bm : n<4, m<=3}