in Theory of Computation retagged by
483 views
0 votes
0 votes

I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume.

Thanks & Regards,

Kiran Watts

in Theory of Computation retagged by
483 views

3 Comments

From gate point of view or for learning point of view?
0
0
From cbsenet point of view.
0
0
reshown by
From any point of view, it comes only through practice, don't worry, you will be able to do it/ understand the trick once you've done enough numericals. It takes time to get a grip on any concept.
0
0

1 Answer

0 votes
0 votes
It becomes very hard to derive a regular expression from a regular language As Regular expressions are non deterministic in nature

Yes, you can practice a lot and get comfortable in it

But a better approach is to Draw a dfa for that language and deriving the regular expression from tht dfa

As it is easy to draw a dfa for a given language

And it is very easy to derive a regular expression from a dfa

Related questions