Register

CMI CS 2025 | Part A | Question: 2

• edited by
299 views

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · CMI CS 2025 | Part A...Next → · CMI CS 2025 | Part A...
← Previous in category · TIFR CSE 2025 | Part...Next in category → · CMI CS 2025 | Part A...
Position:
Show:

Related questions

2 2 votes
2 2 answers
538
538 views
Shubham Sharma 2 asked Jun 20, 2025
538 views
CMI CS 2025 | Part B | Question: 1
Consider the language$$ L=\left\{x \in \{a, b\}^{*} \mid x \text { ends with a palindrome of length at least } 2\right\}.$$Is $L$ regular or not? Justify your answer by e...
0 0 votes
2 2 answers
365
365 views
Shubham Sharma 2 asked Jun 20, 2025
365 views
CMI CS 2025 | Part A | Question: 1
Consider the automaton in Figure $1$, where the start state is $q_{0}$, and the final states (indicated by double circles) are $q_{0}, q_{3}$ and $q_{5}$. Which of the fo...
0 0 votes
2 2 answers
542
542 views
jothee_new asked Sep 6, 2025
542 views
CMI CS 2025 | Part B | Question: 2b
Consider the language $L=\left\{1^{x} O^{y} 1^{z} \mid x>0, y \geqslant 0, z>0\right\}$ over the alphabet $\Sigma=\{0,1\}.$ Construct a $3$-state $\text{NFA }$ for $L$ an...
0 0 votes
2 2 answers
422
422 views
Shubham Sharma 2 asked Jun 20, 2025
422 views
CMI CS 2025 | Part B | Question: 2a
Construct a finite automaton for the language $L$ consisting of all binary strings with equal number of occurrences of $01$ and $10$.