Posted by N V Krishna (59.176.25.86) on January 17, 2007 at 23:25:49:
In Reply to: Re: Reg DFA and CFGs posted by N V Krishna on January 17, 2007 at 15:55:14:
: [1] Yes --> You can give the table, if you want.
Krishna.
: [2] Yes.
: [3] Please mention the assumption you make in your submission. You can look at what standard libraries do.
: Warm regards,
: Krishna.
: : Hello Sir,
: : I have the following doubts.
: : 1)
: : I got a DFA for the first problem in Reg Expr with large number of states even after minimizing.
: : Is it enough that I submit the DFA as a state-transition table or is the state diagram compulsory?
: : 2)As there is nothing mentined about left-factoring or recursion etc., can I take it for granted that any CFG can be given for the second set of problems?
: : 3)In the question with valid stack states, can I assume that top refers to an available position? i.e "Is empty top invalid" ?
: : I apologize for asking questions redundantly if it has already been discussed.
: : Thanks and Regards,
: : Ganesh