question 3 is a regular language I think?

RE=(a+b)*#(a+b)*

RE=(a+b)*#(a+b)*

The Gateway to Computer Science Excellence

0 votes

Give context-free grammars generating the following languages.

- The set of strings over the alphabet $\{a,b\}$ with more $a's$ than $b's$
- The complement of the language $\{a^{n}b^{n}\mid n\geq 0\}$
- $\{w\#x\mid w^{R}$ $\text{is a substring of $x$ for }$ $w,x \in\{0,1\}^{*}\}$
- $\{x_{1}\#x_{2}\#...\#x_{k}\mid k\geq 1,$ $\text{each}$ $ x_{i}\in\{a,b\}^{*},$ $\text{and for some i and }$ $ j,x_{i}=x_{j}^{R}\}$

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,645 questions

56,597 answers

195,837 comments

102,127 users