Register

#TOC Doubt
closed

• closed by
202 views
0 votes
0 votes
closed with the note: doubt cleared

L = anbm / n,m>=1

What type pf Language is this? 

Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same values!?

• closed by
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
Sahil1994 asked Dec 12, 2017
811 views
#TOC DOUBT
A)Is it useful to draw FA if we need to tell the language of the following grammar...? B)What is the language of the following grammar..? C) What will be the final state Of FA and what is the criteria to find out final state.if a given a regular grammar.? S→aB|bA A→aS|bAA|a B→bS|aBB|b
A)Is it useful to draw FA if we need to tell the language of the following grammar...?B)What is the language of the following grammar..?C) What will be the final state O...
User Avatar
3 votes
3 votes
1 answer
3
ashishgateashish asked Mar 13, 2018
1,152 views
#TOC Doubt - Regular expressions
Part A: Given : (b|ab*ab*)* How can it be interpreted as: 1.((b+ab*)ab*)* 2.(b+(ab*ab*))* 3.((b+a)b*ab*)* Part B: 1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA for such questions?
Part A:Given : (b|ab*ab*)* How can it be interpreted as:1.((b+ab*)ab*)* 2.(b+(ab*ab*))*3.((b+a)b*ab*)*Part B:1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA f...
User Avatar
1 votes
1 votes
1 answer
4
Abbas Ahmad asked Nov 30, 2018
411 views
Self doubt about relation between regular and linear grammar
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regular b) G may or may not be regular c) something else
If a grammar G is both left linear as well as right linear then,what should be the case a) G is always not regularb) G may or may not be regularc) something else
User Avatar
Link Copied!