Register

Recent questions tagged regular-expression

0 0 votes
0 0 answers
10.1k
10.1k views
FA to Regular Expression: when no two a's and no two b's should come together
I wanted to covert the finite automata of the question 'when no two a's and no two b's should come together' to regular expression. But I am not able to do so.I have atta...
User Avatar
0 0 votes
1 1 answer
795
795 views
Peter Linz Chapter 4.3 Exercise Q.20
I don't think it will be regular .Had the language been uwwRv the expression could have been (a+b)*(aa+bb)(a+b)* as there is no restriction on w.Is it correct? and if it ...
User Avatar
0 0 votes
1 1 answer
765
765 views
Peter Linz Chapter 4
L = {a^n: n ≥ 2, is a prime number}.This is not a regular language.What about L*?Is it regular? Please explain.
User Avatar
0 0 votes
2 2 answers
1.9k
1.9k views
TOC question on Regular expresstion
Find length of string of minimum length on {0,1}* not in the language corressponding to the given RE 0^*(01^*)^* options are 123None of theseIs it asking to find the mini...
User Avatar
1 1 vote
1 answers 1 answer
568
568 views
Engnineers Academy Workbook
Which one of the following doesn’t generate same language as the rest?$(a+b)^*a(a+b)^*a(a+b)^*$$b^* a b^* a (a + b)^*$$(a + b)^* a b^* a b^*$$b^* a (a + b)^* a b^*$
User Avatar
2 2 votes
2 2 answers
930
930 views
Regular Expressions
Can (ab* + b)* be written as (a + b)*.If so then how?
User Avatar
2 2 votes
2 2 answers
1.0k
1.0k views
Random
Let $'r'$ be a regular expression, then which of the following statements is/are TRUE for every $'r'$?$\qquad S1: \text{There exists 'x' which satisfies property } r + x ...
User Avatar
1 1 vote
1 1 answer
586
586 views
Gateforum booklet
User Avatar
2 2 votes
1 1 answer
496
496 views
Gateforum booklet
Which of the following is false?Regular sets are closed under substitutionRegular sets are closed under homomorphismRegular sets are closed under inverse homomorphismRegu...
User Avatar
0 0 votes
2 answers 2 answers
1.0k
1.0k views
Peter linz exercise 3.1 qsn 20(c)
Give regular expression for all strings containing odd number of zeros on $\{0,1\}$
User Avatar
0 0 votes
1 1 answer
1.6k
1.6k views
theory of computation
Let $L=\{w \in \{0,1\}^∗\mid \text{number of occurences of }(110)=\text{number of occurences of } (011)\}$What is $L$?
User Avatar
1 1 vote
1 answers 1 answer
1.1k
1.1k views
Peter Linz Edition 4 Exercise 3.1 Question 28 (Page No. 77)
Find a regular expression for all bit strings, with leading bit 1, interpreted as a binary integer, with values not between 10 and 30.
User Avatar
0 0 votes
1 answers 1 answer
1.6k
1.6k views
Peter Linz Edition 4 Exercise 3.1 Question 27 (Page No. 77)
Find a regular expression that denotes all bit strings whose value, when interpreted as a binary integer, is greater than or equal to 40.
User Avatar
4 4 votes
1 answers 1 answer
902
902 views
Peter Linz Edition 4 Exercise 3.1 Question 17.d (Page No. 76)
$\sum = \left \{ 0,1 \right \}$Give a regular expression for all strings having at least two occurrences of the substring 00. (Note that with the usual interpretation of ...
User Avatar
1 1 vote
2 answers 2 answers
1.9k
1.9k views
Peter Linz Edition 4 Exercise 3.1 Question 16.c (Page No. 76)
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$All strings that contain at least one occurrence of each symbol in $\sum$
User Avatar
3 3 votes
1 1 answer
5.4k
5.4k views
Peter Linz Edition 4 Exercise 3.1 Question 10 (Page No. 76)
Give a regular expression forL = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
User Avatar
2 2 votes
1 answers 1 answer
723
723 views
Peter Linz Edition 4 Exercise 3.1 Question 9 (Page No. 76)
Give a regular expression for $L^{R}$L = $(a+bc)^{*}(c+\phi)$
User Avatar
3 3 votes
1 answers 1 answer
1.9k
1.9k views
#TOC Doubt - Regular expressions
Part A:Given : (b|ab*ab*)* How can it be interpreted as:1.((b+ab*)ab*)* 2.(b+(ab*ab*))*3.((b+a)b*ab*)*Part B:1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA f...
User Avatar
1 1 vote
0 0 answers
768
768 views
Dfa to regex
please verify the regex
User Avatar
1 1 vote
1 1 answer
702
702 views
ISRO exam
Cfg for regular expression $(ab+a)^* (aa+b)$
User Avatar
1 1 vote
0 0 answers
659
659 views
Regular Expression
What is the regular expression of$L = \{ s \in L$ $i$ = no of $1$ in string $s$$j$ = no of $0$ in string $s$$i+j$ is odd $\}$ ???
User Avatar
1 1 vote
1 1 answer
633
633 views
Uttrakhand Asst. Professor Exam-77
The total number of words represented by the regular expression (^ + a + b) (^ + a + b) (^ + a + b) is815169
User Avatar
0 0 votes
3 3 answers
1.4k
1.4k views
Kset 2017
The string 1101 does not belong to the set represented byA. 110*(0+1)B. (10)*(01)*(00+11)*C. 1(0+1)*101D. 1(10+01)*(1+0)*
User Avatar
1 1 vote
2 2 answers
659
659 views
Doubt
What is identity for regular expressions ?
User Avatar
7 7 votes
3 answers 3 answers
1.6k
1.6k views
CMI2017-A-01
The regular expression $(a^*+b)^*$ is equivalent to which of the following regular expressions: $a^*b^*$$(a^*b+b)^*$ $(a+b^*)^*$$(a^*b)^*$
User Avatar
0 0 votes
1 1 answer
2.2k
2.2k views
Regular expression
S - AaBA - aC | $\epsilon$B - aB | bB | $\epsilon$C - aCb | $\epsilon$Is the regular expression for the above is this:a(a + b)* a ( a* + b* )* ?
User Avatar
0 0 votes
4 4 answers
2.2k
2.2k views
Regular Expression
Can I write $a^* + b^* = (a + b)^*$ ????
User Avatar
0 0 votes
0 0 answers
445
445 views
#TOC Doubt
L = anbm / n,m>=1What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same valu...
User Avatar
3 3 votes
2 2 answers
1.9k
1.9k views
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________a. Regul...
User Avatar
Page: