Reg DFA and CFGs

[ Follow Ups ] [ Post Followup ] [ CSL 862/CS 902 WWWBoard ] [ FAQ ]

Posted by Ganesh Viswanath Sambhu (10.112.2.110) on January 17, 2007 at 12:06:37:

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

Follow Ups:

Re: Re: Reg DFA and CFGs N V Krishna 23:25:49 01/17/07 (0)
Re: Reg DFA and CFGs N V Krishna 15:55:14 01/17/07 (1)

Post a Followup

Name:
E-Mail:

Subject: Re: Reg DFA and CFGs

Comments:
: 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

Optional Link URL:
Link Title:
Optional Image URL:

[ Follow Ups ] [ Post Followup ] [ CSL 862/CS 902 WWWBoard ] [ FAQ ]