I'm not an expert in automata theory, this is a reference request. As far as I have understood it is known in the automata comunity that register automata by Kaminski are closed by intersection with pushdown automata over infinite alphabet. Unfortunately I'm not able to find any reference about this.

Thanks in advance!

  • $\begingroup$ you might start by citing kaminsky register automata.... $\endgroup$ – vzn Apr 11 '12 at 0:04
  • $\begingroup$ a reference I just found said register automata are "similar" to finite memory automata 1st studied by kaminsky [and francez] possibly in this paper of the same name by kaminsky or nearby $\endgroup$ – vzn Apr 11 '12 at 0:11

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.