Register

Search results for expression

1 votes
0 answers
21
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved?
How is "All strings {0,1} of length five or more in which the third symbol from the right end is different from the leftmost symbol" solved? Answer Follow·1 Request ...
User Avatar
1 votes
1 answer
22
#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem
what will be the regular expression of this DFA using Arden's theorem
User Avatar
30 votes
6 answers
24
GATE CSE 1996 | Question: 1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string).$(00)^ * (\varepsilon +0)$$(00)^*$$0^*$$0(00)^*$(i) and (ii)(ii) a...
User Avatar
54 votes
4 answers
25
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
User Avatar
0 votes
1 answer
26
Regular Expression
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.
Write regular expression for the set of strings of 0's and 1's with at most one pair of consecutive 1's.
User Avatar
0 votes
1 answer
28
Regular Expression
Set of binary strings starting with 11 and ending with 00. E.g., 1100,1110100 ,1100100
Set of binary strings starting with 11 and ending with 00. E.g., 1100,1110100 ,1100100
User Avatar
34 votes
5 answers
31
GATE CSE 1994 | Question: 2.10
The regular expression for the language recognized by the finite state automaton of figure is ________
The regular expression for the language recognized by the finite state automaton of figure is ________
User Avatar
1 votes
2 answers
35
DFA to Regular Expression
Help to Convert DFA in to Regular Expression
Help to Convert DFA in to Regular Expression
User Avatar
0 votes
2 answers
37
ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$
User Avatar
37 votes
4 answers
38
GATE CSE 1998 | Question: 1.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
User Avatar
Page: