self dout

Question

Suppose L is language accepted by dfa with some final state

it we convert non final state to final and final state to no final  than this dfa accept the reverse of language L(this is true)

but in case of pda if we convert non final to final  and final to non final state than language is accepted is reverse or not???

suppose aⁿb^{n    is accepted by pda and if we change final to non final and non final to final than which language is accepted byy pda}

Answer 1

Actualy, in DFA  by converting Non final state into final and final into non final we do not get reverse we get complement .

And this is not happen in pda becoz in pda becoz we do not provide all the transitions to all the states thats why dead configuration is present and that's why by converting non final into final and final into non final we dont get complemented language. This is the same reason that we can use for nfa in case of nfa also coplement of machine doesnot provide us complement of language