The Gateway to Computer Science Excellence

0 votes

Write regular definitions for the following languages:

- All strings of lowercase letters that contain the five vowels in order.
- All strings of lowercase letters in which the letters are in ascending lexicographic order.
- Comments, consisting of a string surrounded by /* and */, without an intervening */, unless it is inside double-quotes (").
- All strings of digits with no repeated digits. Hint: Try this problem first with a few digits, such as $\{0,1,2\}$.
- All strings of digits with at most one repeated digit.
- All strings of a's and b's with an even number of a's and an odd number of b's.
- The set of Chess moves, in the informal notation, such as $p-k_{4}$ or $kbp \times qn$.
- All strings of a's and b's that do not contain the substring abb.
- All strings of a's and b's that do not contain the subsequence abb.

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

50,737 questions

57,373 answers

198,511 comments

105,285 users