Dear Srs,
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...
Thanks.
@Filipe. I've read your notes. The idea is sugestive but I can't find out how to accept some context-free languages as {(a^n)(b^m)(a^p)(b^q):n+m=p+q}
On the other hand in the definition of transition function \delta on your example 1, you set \delta(q_1,M)={q_2}, but M is not in the alphabet ... and you cannot collect all possible M's in the alphabet because the M's are an infinite set whereas alphabets must be finite. Perhaps I've misunderstood some point.
- Badges
- Science topic
- Similar topics
- Mathematics