Register

Regular expression Theory of Computation

• edited by
534 views

1 Answer

1 votes
1 votes

Option ( A ) seems correct.

 

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.8k
views
1 answers
0 votes
Rahhhhhul asked Jun 12, 2023
1,842 views
Give a regular expression for L = {a^nb^m: n ≥ 1,m ≥ 1,nm ≥ 3}.
User Avatar
350
views
0 answers
1 votes
smriti bhati asked Jan 26, 2018
350 views
MadeEasy Test Series 2018: Theory of Computation - Regular Grammer
What is the correct way to solve questions of this kind where equations like these are given and you are asked to determine what languages do the variables X1 X2 X3.. represent?
User Avatar
824
views
1 answers
0 votes
ARUN KUMAR 3 asked Oct 15, 2016
824 views
MadeEasy Test Series: Theory Of Computation - Regular Grammar
The grammer {S--> aA | aB | ε, A--> Ab | ε } is(a) Regular and Linear(b) Regular but not Linear(c) Linear but not Regular(d) Neither Linear nor Regular
User Avatar
Link Copied!