Register

ullman chapter regular expressions and languages exercise 3.1

239 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
Ayush Upadhyaya asked Mar 10, 2017
1,278 views
Peter Linz-Chapter 3.1 Regular Expressions
Give a regular expression for the language over {0,1} NOT CONTAINING 101 AS SUBSTRING.
Give a regular expression for the language over {0,1}NOT CONTAINING 101 AS SUBSTRING.
User Avatar
0 votes
0 votes
2 answers
2
Ayush Upadhyaya asked Mar 9, 2017
552 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for all strings over {0,1) not ending in 01.
Give regular expression for all strings over {0,1) not ending in 01.
User Avatar
0 votes
0 votes
2 answers
3
Ayush Upadhyaya asked Mar 9, 2017
2,613 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the language L={an bm | n≥1, m≥1, nm≥3}
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
User Avatar
0 votes
0 votes
2 answers
4
Ayush Upadhyaya asked Mar 9, 2017
530 views
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for the complement of the language L = { an bm : n<4, m<=3}
Give regular expression for the complement of the languageL = { an bm : n<4, m<=3}
User Avatar
Link Copied!