Register

Regular languages

527 views
0 votes
0 votes

 

Kindly give the reason behind 2 and 3?

User Avatar

1 Answer

0 votes
0 votes
1) m and n are independent so  NO comparison.----> Regular

2)   n = 2m ( one comparison ) -----> CFL ( its also DCFL ---> clearly see push and pop)

3)   similar to previous ---> CFL

4)   it takes all string with C as a constant. ----> regular.

Hence Option A is correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
practicalmetal asked Mar 25, 2023
379 views
Regular Languages
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵ a) an infinite number of solutions b) a finite number of solutions c) is always unique d) none
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
User Avatar
1 votes
1 votes
1 answer
2
atulcse asked Jan 28, 2022
481 views
regular languages - TOC
Which of the following languages is/are regular?
Which of the following languages is/are regular?
User Avatar
5 votes
5 votes
3 answers
3
Hirak asked May 25, 2019
1,810 views
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
User Avatar
Link Copied!