Re: [racket-users] Are syntax transformations tree automata?

The coimputational power of Racket’s syntax transformation system is equivalent to that of Turing machines. [[ The expressive power is a bit limited and we’re working on expanding it, but I don’r think you’re asking about this. ]] — Matthias > On Apr 23, 2019, at 7:29 AM, Ilnar

[racket-users] Are syntax transformations tree automata?

Hi all! I was glancing over these books [1] and [2] on tree automata. I assume that Racket's macro system / syntax transformations fall under the category of tree transducers. Can anybody please point me to a paper which describes its expressive power in formal terms, if any? The reason I