海量图书期刊资源,随时随地畅享阅读乐趣
Simple monadic theories and indiscerniblesAchim Blumensath · 2011
Axiomatising Tree-Interpretable StructuresAchim Blumensath · Theory of Computing Systems · 2004
Recognisability for algebras of infinite treesAchim Blumensath · 2011
A model-theoretic characterisation of clique widthAchim Blumensath · 2006
Linear temporal logic for regular cost functionsBlumensath, Achim; Otto, Martin; Weyer, Mark · Logical Methods in Computer Science · 2014
An algebraic proof of Rabin’s Tree TheoremBlumensath, Achim · Theoretical Computer Science · 2013
A syntactic congruence for languages of birooted treesBlumensath, Achim; Janin, David · Semigroup Forum · 2015