No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
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 …
|
|
|
Hi, I've been trying to translate a PDA with a finite stack to an FSA and haven't succeeded. What approach do I take to do this? It can be non-deterministic. Thanks
|