I learned about ASM recently and was interested how it could used for descriptive complexity theory.
Such link seems natural to me: you can give construction of algebraic model for formula as an ASM. Refining ASM further you get regular machine and prove complexity bound for it.
Is this possible to prove core description complexity theorems this way? Are there a reference for this? I did not found any.