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

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

554 views

GO Classes asked Feb 5

4 votes

2 answers

6

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

347 views

GO Classes asked Jan 13

1 votes

2 answers

7

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

Help to Convert DFA in to Regular Expression

alexmurugan

461 views

alexmurugan asked Nov 2, 2023

0 votes

2 answers

8

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

396 views

Pratik.patil asked Oct 30, 2023

0 votes

1 answer

9

#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

333 views

Mrityudoot asked Oct 21, 2023

0 votes

1 answer

10

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

dvlken

363 views

dvlken asked Oct 16, 2023

0 votes

1 answer

11

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

Please explain the why A and D are correct?

Rohit Chakraborty

462 views

Rohit Chakraborty asked Oct 5, 2023

1 votes

0 answers

12

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

357 views

krati_ag19 asked Sep 22, 2023

0 votes

1 answer

13

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

Solve this using Adrens lemma rule.

iam.sahilpatra

212 views

iam.sahilpatra asked Sep 16, 2023

0 votes

1 answer

14

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

390 views

kaustubh7 asked Aug 24, 2023

0 votes

1 answer

15

#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

415 views

D_i_b_y_a prakash asked Aug 13, 2023

1 votes

1 answer

16

#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

370 views

D_i_b_y_a prakash asked Aug 12, 2023

0 votes

1 answer

17

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

249 views

Mohamad asked Aug 8, 2023

1 votes

2 answers

18

Self Doubt
Convert DFA to regular expression

Convert DFA to regular expression

Shaina Singh

538 views

Shaina Singh asked Jul 30, 2023

1 votes

2 answers

19

Convert given DFA to regular expression, I think it's just that 2 is dead state and thus can be eliminated.

Shaina Singh

802 views

Shaina Singh asked Jul 30, 2023

0 votes

3 answers

20

Theory of computation
Which of the following pairs of regular expression are equivalent? (a) 1(01)* and (10)*1 (b) x(xx)* and (xx)*x (c) x* and x*x (d) All of the above

Which of the following pairs of regular expression are equivalent?(a) 1(01)* and (10)*1(b) x(xx)* and (xx)*x(c) x* and x*x(d) All of the above

gateexplore

496 views

gateexplore asked Jul 3, 2023

0 votes

0 answers

21

Thomson Construction
Describe Thomson Construction method for converting Regular expression into ε-NFA. Convert regular expression (a(a+b)*abb)+ab into ε-NFA.

Describe Thomson Construction method for converting Regular expression into ε-NFA. Convert regular expression (a(a+b)*abb)+ab into ε-NFA.

gateexplore

258 views

gateexplore asked Jun 16, 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