Recent questions tagged regular-expression / GATE Overflow for GATE CSE

0 votes

0 answers

1

Regular Expresssion And NFA
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 ... b, (, *)}. (a) Provide an NFA that recognizes language C . (b) Present a regular expression that generates C.

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...

rdrd44

49 views

rdrd44 asked 4 days ago

1 votes

0 answers

2

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 ...

paressep28

85 views

paressep28 asked Apr 25

1 votes

1 answer

3

#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

prabhath challa

82 views

prabhath challa asked Apr 18

0 votes

0 answers

4

Regular Expresssion And NFA (THEORY OF AUTOMATA ASSIGNMENT # 1)
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 even number of b's c. All strings that contain atleast ... with double letters (aa or bb) e. All strings that does not ends with double letter.(can end with ab or ba)

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 a...

Talha Riaz

148 views

Talha Riaz asked Mar 23

0 votes

1 answer

5

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

hasina ali

113 views

hasina ali asked Mar 21

0 votes

1 answer

6

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.

utsav22222

199 views

utsav22222 asked Mar 15

0 votes

0 answers

7

#toc

Çșȇ ʛấẗẻ

97 views

Çșȇ ʛấẗẻ asked Feb 24

0 votes

0 answers

8

#TOC

Çșȇ ʛấẗẻ

63 views

Çșȇ ʛấẗẻ asked Feb 24

1 votes

3 answers

9

GATE CSE 2024 | Set 2 | Question: 52
Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}$, where $|w|$ denotes the length of string $w$. The number of strings in $L_{2}$ which are also in $L_{1}$ is _________.

Let $L_{1}$ be the language represented by the regular expression $b^{*} a b^{*}\left(a b^{*} a b^{*}\right)^{*}$ and $L_{2}=\left\{w \in(a+b)^{*}|| w \mid \leq 4\right\}...

Arjun

2.2k views

Arjun asked Feb 16

2 votes

3 answers

10

GATE CSE 2024 | Set 1 | Question: 51
Consider the following two regular expressions over the alphabet $\{0,1\}$ : $r= 0^{*}+1^{*}$ $s = 01^{*} + 10^{*}$ The total number of strings of length less than or equal to $5$, which are neither in $r$ nor in $s$, is ________.

Consider the following two regular expressions over the alphabet $\{0,1\}$ :$r= 0^{*}+1^{*}$$s = 01^{*} + 10^{*}$The total number of strings of length less than or equal ...

Arjun

2.0k views

Arjun asked Feb 16

0 votes

0 answers

11

Regular expression to finite automata

Çșȇ ʛấẗẻ

234 views

Çșȇ ʛấẗẻ asked Feb 15

3 votes

2 answers

12

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 35
Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$ $b b b b$ $bbaaabb$ $bbaaabbbabb$ $b b a b b b a b$

Which of the following strings are a member of the language described by the regular expression $\left(a^* {b} {a}^* b a^* b {a}^*\right)^*$$b b b b$$bbaaabb$$bbaaabbbabb...

GO Classes

598 views

GO Classes asked Feb 5

4 votes

2 answers

13

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 62
Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful transition is possible for the given symbol. Note that when encountering a $b$ in state ... $\mathrm{abbb}^+\mathrm{c}^+\mathrm{c}$ $a b^* b b(c c)^+$

Below you see the transition table of a finite state automaton. The initial state is $0;$ the final state is $4.$ $\emptyset$ denotes the fail state, where no successful ...

GO Classes

362 views

GO Classes asked Jan 13

1 votes

2 answers

14

DFA to Regular Expression
Help to Convert DFA in to Regular Expression

Help to Convert DFA in to Regular Expression

alexmurugan

483 views

alexmurugan asked Nov 2, 2023

0 votes

2 answers

15

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)^*$

Pratik.patil

407 views

Pratik.patil asked Oct 30, 2023

0 votes

1 answer

16

#Regular Languages
For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows say a*(b). Will the automaton not ‘hang’ if a string $a^n$ where $n \to$ ∞ is fed to it? Isn’t ‘never accepting but progressing’ the same as hanging?

For a particular input, a turing machine can ‘hang’ on encountering an infinite loop. Why can’t we say the same for any other machine? i.e A DFA or NFA that follows...

Mrityudoot

340 views

Mrityudoot asked Oct 21, 2023

0 votes

1 answer

17

Find the complement of the following expressions: (a) (a + c) (a + b’) (a’ + b + c’) (b) z + z’(v’w + xy)

dvlken

418 views

dvlken asked Oct 16, 2023

0 votes

1 answer

18

Made easy test series
Please explain the why A and D are correct?

Please explain the why A and D are correct?

Rohit Chakraborty

473 views

Rohit Chakraborty asked Oct 5, 2023

1 votes

0 answers

19

Let P,Q and R be regular expressions such that the number of strings generated by P is p, Q is q and R is r. What is the number of strings generated by the regular expression (P+R)*Q+PQ?

krati_ag19

363 views

krati_ag19 asked Sep 22, 2023

0 votes

1 answer

20

Applied roots practice set3 TOC 2019
Solve this using Adrens lemma rule.

Solve this using Adrens lemma rule.

iam.sahilpatra

231 views

iam.sahilpatra asked Sep 16, 2023

0 votes

1 answer

21

made easy test series 2023 question
Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following: Which one of them is correct ?

Let r = a(a + b)*, S = aa*b and t = a* b be three regular expressions. Consider the following:Which one of them is correct ?

kaustubh7

396 views

kaustubh7 asked Aug 24, 2023

0 votes

1 answer

22

#regularexpressions #Theoryofcomputation
L = (a+b)$\small ^*$b is equivalent to ____________? A. (ab$\small^*$)$\small^+$ B. (a$\small^+$b$\small^*$)$\small^+$ C. b$\small^*$(ab$\small^*$)$\small^*$b D. None

L = (a+b)$\small ^*$b is equivalent to ____________?A. (ab$\small^*$)$\small^+$B. (a$\small^+$b$\small^*$)$\small^+$C. b$\small^*$(ab$\small^*$)$\small^*$bD. None

D_i_b_y_a prakash

443 views

D_i_b_y_a prakash asked Aug 13, 2023

1 votes

1 answer

23

#Theoryofcomputation #regularexpressions
A = aa* and B = bb* ( A U B) * =? 1.{ a^nb^n | n >= 0} 2.{ a^mb^n | m, n >=0} 3.(a+b)* 4.None

A = aa* and B = bb*( A U B) * =? 1.{ a^nb^n | n >= 0}2.{ a^mb^n | m, n >=0}3.(a+b)*4.None

D_i_b_y_a prakash

395 views

D_i_b_y_a prakash asked Aug 12, 2023

0 votes

1 answer

24

Automation exam in the Faculty of Informatics Engineering, Damascus University
What is the regular expression that accept following string aaaabbbb ؟ a) a+ b+ b) a* b* c) (a+b)* (a+b)* d) (a+b)* e) abab

What is the regular expression that accept following string aaaabbbb ؟a) a+ b+b) a* b*c) (a+b)* (a+b)*d) (a+b)*e) abab

Mohamad

254 views

Mohamad asked Aug 8, 2023

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true