Hi,This is Homework Help, not Homework Done For You.
How may times do we have to say this to you?
You constantly want people to guide you from the very beginning of a problem. That's not going to help you in the long run. YOU need to at least START down a solution path, even if that path turns out to be a dead end.
The whole point of learning any of this is so that YOU can become a problem solver -- someone who solves other people's problems. Unless you expect the people that hire you to solve their problems to always guide you on how to start, you better start learning how to start on your own.
So, what are the basic tools that you have available to establish whether or not a language is regular?
0 + 0 +0=>1 waysAnd how many of your threads have started with nothing more than some solution that you found on the internet?
What do you mean by "powers are linear" and what does that have to do with it being a regular language or not?
Is L = aⁿ bⁿ
a regular language since the powers are linear?
I got following from geeksforgeeks:
How many possible ways are there to have n+l+k such that the sum is NOT greater than 5?The pattern of strings form an A.P.(Arithmetic Progression) is regular(i.e it’s power is in
form of linear expression),
but the pattern with G.P.(Geometric Progression) is not regular(i.e its power is in form of
non-linear expression) and it comes under class of Context Sensitive Language.
Document says that:So if there are a finite number of ways that have to be considered, what does that mean as far as the ability to construct a DFA?
|Thread starter||Similar threads||Forum||Replies||Date|
|Z||How to prove if Language L1 is equal to Language L2||Homework Help||7|
|A||Boolean Algebra: What's the simplest way to prove this?||Homework Help||7|
|How to Prove the following statement?||Homework Help||3|
|O||How can I prove that gamma distribution is a correct PDF?||Math||2|
|need help to prove this equation in transistor||Homework Help||13|