I want to proof Recursive Automata (my definition) acepts th...
First I would like to excuse my English, but is not
my native language.
I am a software developer with interest in Automaton Theory, I have a few related project that you can see here http://fsvieira.com/,
but I lack of math knowledge.
So, I made my own definition of a non-deterministic recursive automaton, that you can find here http://fsvieira.com/nar.pdf, and now I want to proof that my definition can accept the same languages that a non-deterministic pushdown automaton can.
But I don't have the skills to do it, so I just asking for some hints, what exercises should I do, what books can I read...
- Planetary Bugs
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)
- Other useful stuff