The Gateway to Computer Science Excellence

0 votes

Design grammars for the following languages:

- The set of all strings of $0's$ and $1's$ such that every $0$ is immediately followed by at least one $1$.
- The set of all strings of $0's$ and $1's$ that are palindromes; that is, the string reads the same backward as forward.
- The set of all strings of $0's$ and $1's$ with an equal number of $0's$ and $1's$.
- The set of all strings of $0's$ and $1's$ with an unequal number of $0's$ and $1's$.
- The set of all strings of $0's$ and $1's$ in which $011$ does not appear as a substring.
- The set of all strings of $0's$ and $1's$ of the form $xy$, where $x\neq y$ and $x$ and $y$ are of the same length.

- 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,648 questions

56,455 answers

195,309 comments

100,135 users