1
How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countab...
2
Consider the following statements. S1: An unambiguous left recursive grammar must be CLR(1). S2: A DCFG may or may not be LL(1). Select the correct option: 1.Both S1 and ...
3
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
4
$L=\{wa^nw^Rb^n\mid w\in \left \{ a,b \right \}^\ast ,n\geqslant 0\}$ Can anyone give me step by step solution that shows this is not CFL by pumping Lemma?
5
equivalence of two regular language can be tested in (worst case)? polynomial time sub linear time exponential time poly logarithmic time
6
please explain all options with example
7
Where can I get the solution manual for An Introduction to Formal Languages and Automata by peter linz for the back exercises?
8
what is the difference between, r* and r^(*) can anyone please elaborate !
9
Is the diagonalization language (Ld) countable?
10
If for every RE there exist a TM that accepts it, is it possible that for 2 different RE languages there exists a single TM that accepts them?
11
Please explain the ans. Ans is (B)
12
Please explain with simplified diagram the transition in the pda. Ans (d)
13
Let $\sum = \{0,1\}$ Let $A=\{0^{k}u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.$ Show that $A$ is regular. Let $B=\{0^{k}1u0^{k}|k\geq 1$ $\text{and}$ $u\in \sum^{*}\}.... 1 answer 14 If$A$and$B$are languages, define$A \diamond B = \{xy \mid x \in A\: \text{and}\: y \in B \;\text{and} \mid x \mid = \mid y \mid \}$. Show that if$A$and$B$are reg... 1 answer 15 identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain 1 answer 16 Steps to find the answer? 1 answer 17 Identify whether the language is regular or not and plz justify the ans. 0 answers 18 Need help , to identify the regular languages 1 answer 19 For each of the following languages, give two strings that are members and two strings that are not members—a total of four strings for each part. Assume the alphabet$...
20
How to decide function is Homorphism.
21
Why the complement of a CFL is CSL?
22
please verify the answer I think BD on ‘b’ going on ‘BD’??
23
please explain it how to solve such question in exam Ans: 22
24
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.
25
Examples of what works: 01101101101101 1011101010 1010 0101
26
Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states
27
From (a+b+c)* we can generate either a or b or c and kleene closure of that alphabet i.e a* or b* or c* which is same as (a*+b*+c*) .
28
$L=\{a^mb^n\mid m≠n\}∪{(a+b)^∗b(b+a)^*a(a+b)^∗}= \;\{a^mb^n\mid m<n\} \cup \{a^mb^n\mid m>n\} \cup (a+b)^*b(a+b)^*a(a+b)^*$ It is DCFL ∪ Regular, hence it shoul...
29
Ex. (baaab, babababa, aaabbaaabbb) Ex. (babab, abaaabb, aaaa, bbab)
30
Construct equivalent DFA transaction table for the following NFA.
I am still having some doubts when it comes to Context-Free Grammar to Chomsky Normal Form conversion. Here is what I did for the following CFG: $S \rightarrow bXb \ |\ b... 1 answer 35 Given language L = (0+1)*0^n, define a DFA with as few states as possible with n > 0. 0 answers 36 I am trying to construct a CFG for this following langauge: L =$\{0^i 1^j | i \neq j \ and \ i, j > 0\}$, this is what I came up with:$ S \rightarrow A \ | \ B A \ri...