Recent questions tagged peter-linz-edition4

3 3 votes
1 1 answer
5.3k
5.3k views
Give a regular expression forL = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
2 2 votes
1 answers 1 answer
710
710 views
1 1 vote
3 answers 3 answers
2.7k
2.7k views
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$$L = \left \{ w : n_{a}\left ( w \right ) n_{b}\...
1 1 vote
1 1 answer
575
575 views
Find the grammar for the following language$L = \left \{ w: \left | w \right | mod 3 \geq \left | w \right | mod 2 \right \}$
3 3 votes
1 answers 1 answer
848
848 views
$L = \left \{ a^{n} b^{m} : n\geq 0,m>n \right \}$Find a grammar that generates $L^3$
1 1 vote
1 1 answer
1.5k
1.5k views
Which of the following is false for derivation tree of CFG- $G (V, T, P, S)$ ?The root is labeled $S$.Every leaf has a label from $V ⋃ T ⋃ \{ λ \}$.A vertex with a child...
0 0 votes
0 0 answers
687
687 views
Consider the language $L = \{a^nb^nc^m\}U \{a^nb^mc^m\}$ with $n$ and $m$ nonnegative. Which of the following options is correct?There is no context free grammar possible...
2 2 votes
1 1 answer
2.2k
2.2k views
0 0 votes
0 0 answers
2.3k
2.3k views
Find a linear bounded automata that accepts the language1. L={a^(n!) : n>=0}2. L ={a^n : n is perfect square}Please explain.
4 4 votes
5 5 answers
5.3k
5.3k views
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to lan...
1 1 vote
1 answers 1 answer
1.3k
1.3k views
Give a verbal description of the language generated by the productions:S → aSbS → bSaS → aa
0 0 votes
2 answers 2 answers
949
949 views
Find a grammar that generates the language:L = {$w$$w^R$ : $w$ ∈ {a, b}+}
2 2 votes
1 1 answer
2.3k
2.3k views
Q3) Given,$L_1 = (aaa^*b)$$L_2 = (aab^*aba^*)$Find (c) the union of $L_1$ and $L_2$, and also find (d) $L_1 - L_2$.Q4) Find the npda's of the following:f) $L = \{ a^nb^m...
1 1 vote
3 3 answers
2.8k
2.8k views
Regular Expression:-Q1) What languages do the expression (∅*)* and a∅ denote?Q2) Find a regular expression and finite automata for all bit strings, with leading bit 1...
4 4 votes
1 1 answer
2.4k
2.4k views
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
0 0 votes
2 2 answers
3.7k
3.7k views
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
8 8 votes
2 answers 2 answers
22.9k
22.9k views
(d) all strings with at least one a and exactly two b’s(e) all the strings with exactly two a’s and more than two b’s.
2 2 votes
1 answers 1 answer
805
805 views
Plez Tell someone briefly ..............though i have already the anwers but i couldn't get it properlyyy
1 1 vote
0 0 answers
624
624 views
Find regular expression for$\left \{ a^{n}b^{m}:(n+m)\ is\ even \right \}$.
2 2 votes
3 answers 3 answers
3.4k
3.4k views
Find a regular expression over Σ ={a,b,c} for all strings that contain no run of a's of length greater than 2. Here a run in a string is a sub string of length at least t...