Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged regular-language
43
votes
3
answers
691
GATE CSE 2014 Set 2 | Question: 15
If $L_1\:=\{a^n \mid n\:\geq\:0\}$ and $L_2\:= \{b^n \mid n\:\geq\:0\}$ , consider $L_1.L_2$ is a regular language $L_1.L_2 = \{a^nb^n \mid n\: \geq \:0\}$ Which one of the following is CORRECT? Only I Only II Both I and II Neither I nor II
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
10.7k
views
gatecse-2014-set2
theory-of-computation
normal
regular-language
25
votes
3
answers
692
GATE CSE 2014 Set 1 | Question: 15
Which one of the following is TRUE? The language $L = \left\{a^nb^n \mid n \geq 0\right\}$ is regular. The language $L = \left\{a^n \mid n \text{ is prime }\right\}$ is regular. The language $L$ ... is regular. The language $L = \left\{ww \mid w \in \Sigma^* \text{ with } \Sigma = \left\{0,1\right\}\right\}$ is regular.
go_editor
asked
in
Theory of Computation
Sep 26, 2014
by
go_editor
9.2k
views
gatecse-2014-set1
theory-of-computation
regular-language
normal
23
votes
3
answers
693
GATE CSE 1998 | Question: 2.6
Which of the following statements is false? Every finite subset of a non-regular set is regular Every subset of a regular set is regular Every finite subset of a regular set is regular The intersection of two regular sets is regular
Kathleen
asked
in
Theory of Computation
Sep 25, 2014
by
Kathleen
6.3k
views
gate1998
theory-of-computation
easy
regular-language
24
votes
4
answers
694
GATE CSE 2012 | Question: 25
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$? $ abaabaaabaa$ $ aaaabaaaa$ $ baaaaabaaaab$ $ baaaaabaa$ $\text{1, 2 and 3}$ $\text{2, 3 and 4}$ $\text{1, 2 and 4}$ $\text{1, 3 and 4}$
Arjun
asked
in
Theory of Computation
Sep 25, 2014
by
Arjun
7.3k
views
gatecse-2012
theory-of-computation
easy
regular-language
28
votes
4
answers
695
GATE CSE 1999 | Question: 6
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer. Given two finite automata $M1, M2$, outline an algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
4.1k
views
gate1999
theory-of-computation
normal
regular-language
descriptive
50
votes
5
answers
696
GATE CSE 2013 | Question: 8
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
Arjun
asked
in
Theory of Computation
Sep 23, 2014
by
Arjun
18.7k
views
gatecse-2013
theory-of-computation
normal
regular-language
39
votes
2
answers
697
GATE CSE 2007 | Question: 31
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
Kathleen
asked
in
Theory of Computation
Sep 21, 2014
by
Kathleen
14.1k
views
gatecse-2007
theory-of-computation
normal
regular-language
38
votes
3
answers
698
GATE CSE 2007 | Question: 7
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a non-regular set is regular The union of two non-regular sets is not regular Infinite union of finite sets is regular
Kathleen
asked
in
Theory of Computation
Sep 21, 2014
by
Kathleen
15.3k
views
gatecse-2007
theory-of-computation
easy
regular-language
83
votes
8
answers
699
GATE CSE 2006 | Question: 29
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3-digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$
Rucha Shelke
asked
in
Theory of Computation
Sep 18, 2014
by
Rucha Shelke
19.5k
views
gatecse-2006
theory-of-computation
normal
regular-language
21
votes
5
answers
700
GATE CSE 2001 | Question: 2.6
Consider the following languages: $L1=\left\{ww \mid w \in \{a,b\}^*\right\}$ $L2=\left\{ww^R \mid w \in \{a,b\}^*, w^R \text{ is the reverse of w} \right\}$ $L3=\left\{0^{2i} \mid \text{ i is an integer} \right\}$ ... $L1$ and $L2$ Only $L2, L3$ and $L4$ Only $L3$ and $L4$ Only $L3$
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
8.0k
views
gatecse-2001
theory-of-computation
normal
regular-language
24
votes
2
answers
701
GATE CSE 2001 | Question: 1.4
Consider the following two statements: $S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
14.7k
views
gatecse-2001
theory-of-computation
easy
regular-language
27
votes
2
answers
702
GATE CSE 2000 | Question: 7
Construct as minimal finite state machine that accepts the language, over $\{0,1\}$, of all strings that contain neither the substring $00$ nor the substring $11$. Consider the grammar $S \to aSAb $ $S \to \epsilon $ $A \to bA $ $ A \to \epsilon $ where $S$ ... $i, j \geq 0$, where $i$ and $j$ satisfy some condition. What is the condition on the values of $i$ and $j$?
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
4.6k
views
gatecse-2000
theory-of-computation
descriptive
regular-language
context-free-language
39
votes
6
answers
703
GATE CSE 2000 | Question: 2.8
What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states? $L$ must be $\{a^n \mid n \ \text{ is odd}\}$ $L$ must be $\{a^n \mid n \ \text{ is even}\}$ $L$ must be $\{a^n \mid n \geq 0\}$ Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
8.9k
views
gatecse-2000
theory-of-computation
easy
regular-language
21
votes
1
answer
704
GATE CSE 1991 | Question: 03,xiv
Which of the following is the strongest correct statement about a finite language over some finite alphabet $\Sigma?$ It could be undecidable It is Turing-machine recognizable It is a context-sensitive language. It is a regular language. None of the above,
Kathleen
asked
in
Theory of Computation
Sep 12, 2014
by
Kathleen
8.3k
views
gate1991
theory-of-computation
easy
regular-language
multiple-selects
34
votes
2
answers
705
GATE CSE 2008 | Question: 53
Which of the following are regular sets? $\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$ $\left\{a^nb^m \mid n =2m \right\}$ $\left\{a^nb^m \mid n \neq m \right\}$ $\left\{xcy \mid x, y, \in \left\{a, b\right\} ^* \right\}$ I and IV only I and III only I only IV only
Kathleen
asked
in
Theory of Computation
Sep 12, 2014
by
Kathleen
9.5k
views
gatecse-2008
theory-of-computation
normal
regular-language
5
votes
2
answers
706
Which of the following are useful in proving a language to be regular?
Which of the following are useful in proving a language to be regular? Myhill-Nerode theorem Pumping lemma Drawing an NFA Forming a regular expression (A) All of these (B) 1, 3 and 4 only (C) 2, 3 and 4 only (D) 3 and 4 only
Arjun
asked
in
Theory of Computation
Aug 27, 2014
by
Arjun
1.3k
views
theory-of-computation
regular-language
normal
3
votes
1
answer
707
Let L be a regular language
Let $L$ be a regular language and $w$ be a string in $L$. If $w$ can be split into $x, y$ and $z$ such that $|xy| \leq$ number of states in the minimal DFA for $L$, and $|y| > 0$ then, (A) $\forall i \in N, xy^iz \notin L$ (B) $\exists i \in N, xy^iz \in L$ (C) $\forall i \in N, xy^iz \in L$ (D) $\exists i \in N, xy^iz \notin L$
Arjun
asked
in
Theory of Computation
Aug 27, 2014
by
Arjun
810
views
theory-of-computation
easy
regular-language
Page:
« prev
1
...
19
20
21
22
23
24
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged regular-language
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...