No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
3 Posted Topics
 | I define a Decider PDA, a PDA (nondeterministic or deterministic) that does not loop for any input(I mean that it halt for every input,accept or reject). I want to know more about these PDAs and the class of functions they compute. Actually I didn't find about it in texts... I … |
| | Hi. If I define Poly-time functions, the functions that are computable by a turing machine in maximum polynomial(n) time, which n is size of input. Is the class of these functions recursively enumerable? I think that this Poly-time is the famous P-class in complexity,but as I searched I didn't find … |
| | [QUOTE=shakssage;1400472]A PDA with a [B]finite stack[/B] can be translated into an FSA. What you need to do is encode the stack as states. I've done it though, so it's solved. Thanks.[/QUOTE] I have the same question,would you please explain to me,how should I encode the stack? |
The End.