info@avatto.com
+91-9920808017
0. Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → ν, with |ν| = k > 1. The derivation tree for any string W ∈ L (G) has a height such that
h<((|W| - 1)/k-1)
logk|W| < h
logk|W| < h < ((|W| - 1)/k-1)
logk|W| <= h <= ((|W| - 1)/k-1)
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.