Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1995+theory-of-computation
29
votes
9
answers
1
GATE CSE 1995 | Question: 1.9 , ISRO2017-13
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits respectively, which of the following expressions defines an identifier? $(L + D)^+$ $(L.D)^*$ $L(L + D)^*$ $L(L.D)^*$
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits ...
Kathleen
13.2k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
regular-expression
easy
isro2017
+
–
41
votes
5
answers
2
GATE CSE 1995 | Question: 2.23
A finite state machine with the following state table has a single input $x$ and a single out $z$ ... $C$ is: $01$ $10$ $101$ $110$
A finite state machine with the following state table has a single input $x$ and a single out $z$.$$\begin{array}{|c|ll|}\hline\textbf{present state} & \qquad \textbf{nex...
Kathleen
11.4k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
finite-automata
normal
+
–
32
votes
8
answers
3
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...
Kathleen
10.5k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
easy
context-free-language
+
–
26
votes
5
answers
4
GATE CSE 1995 | Question: 2.24
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n > 0\right\} $ then the languages $L \cup R$ and $R$ are respectively regular, regular not regular, regular regular, not regular not regular, not regular
Let $\Sigma=\left\{0,1\right\}, L = \Sigma^*$ and $R=\left\{0^n1^n \mid n 0\right\} $ then the languages $L \cup R$ and $R$ are respectivelyregular, regularnot regular, ...
Kathleen
15.9k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
easy
regular-language
+
–
20
votes
2
answers
5
GATE CSE 1995 | Question: 11
Let $L$ be a language over $\Sigma$ i.e., $L\subseteq \Sigma^*$. Suppose $L$ satisfies the two conditions given below. $L$ is in NP and For every $n$, there is exactly one string of length $n$ that belongs to $L$. Let $L^c$ be the complement of $L$ over $\Sigma^*$. Show that $L^c$ is also in NP.
Let $L$ be a language over $\Sigma$ i.e., $L\subseteq \Sigma^*$. Suppose $L$ satisfies the two conditions given below.$L$ is in NP andFor every $n$, there is exactly one ...
Kathleen
3.7k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
normal
decidability
proof
descriptive
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register