mathmari
Badges: 1
Rep:
? You'll earn badges for being active around the site. Rep gems come when your posts are rated by other community members.
#1
Report Thread starter 7 years ago
#1
Hey!!

I have to write an O(n^3) algorithm to determine whether a given string w=a_1 a_2 \dots a_n is in L(G), where G=(N,\Sigma ,P, S) is a context-free grammar in Chomsky normal form.

Could you explain me how we could use the dynamic programming in this case??
0
reply
jadys10
Badges: 14
Rep:
? You'll earn badges for being active around the site. Rep gems come when your posts are rated by other community members.
#2
Report 7 years ago
#2
(Original post by mathmari)
Hey!!

I have to write an O(n^3) algorithm to determine whether a given string w=a_1 a_2 \dots a_n is in L(G), where G=(N,\Sigma ,P, S) is a context-free grammar in Chomsky normal form.

Could you explain me how we could use the dynamic programming in this case??
Scroll down to his web development tutorials, he's really good at explaining things.
https://m.youtube.com/channel/UCc1Pn7FxieMohCZFPYEbs7w
0
reply
MaxwellBriggs
Badges: 0
Rep:
? You'll earn badges for being active around the site. Rep gems come when your posts are rated by other community members.
#3
Report 6 years ago
#3
This talk has two goals:
a) A review of the fundamentals of dynamic programming, and an introduction to nonserial dynamic programming.


b) An application of the techniques to some of the issues involved in the problem of determining globally optimum storage patterns.


1
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

Would you give consent for uni's to contact your parent/trusted person in a mental health crisis?

Yes - my parent/carer (117)
34.21%
Yes - a trusted person (92)
26.9%
No (91)
26.61%
I'm not sure (42)
12.28%

Watched Threads

View All