Achim Blumensath

According to our database, Achim Blumensath authored at least 35 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Some Remarks on First-Order Definable Tree Languages.

Achim Blumensath

CoRR, 2024

2023

The Power-Set Construction for Tree Algebras.

Achim Blumensath

Log. Methods Comput. Sci., 2023

The Expansion Problem for Infinite Trees.

Achim Blumensath

CoRR, 2023

2021

Algebraic Language Theory for Eilenberg-Moore Algebras.

Achim Blumensath

Log. Methods Comput. Sci., 2021

ω-Forest Algebras and Temporal Logics.

Achim Blumensath, Jakub Lédl

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Bisimulation invariant monadic-second order logic in the finite.

Achim Blumensath, Felix Wolf

Theor. Comput. Sci., 2020

Regular Tree Algebras.

Achim Blumensath

Log. Methods Comput. Sci., 2020

2018

Branch-Continuous Tree Algebras.

Achim Blumensath

CoRR, 2018

2017

A Compositional Coalgebraic Semantics of Strategic Games.

Achim Blumensath, Viktor Winschel

CoRR, 2017

2016

On a Fragment of AMSO and Tiling Systems.

Achim Blumensath, Thomas Colcombet, Pawel Parys

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2014

Decidability Results for the Boundedness Problem.

Achim Blumensath, Martin Otto, Mark Weyer

Log. Methods Comput. Sci., 2014

Monadic second-order definable graph orderings.

Achim Blumensath, Bruno Courcelle

Log. Methods Comput. Sci., 2014

Asymptotic Monadic Second-Order Logic.

Achim Blumensath, Olivier Carton, Thomas Colcombet

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Two-way cost automata and cost logics over infinite trees.

Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

An algebraic proof of Rabin's Tree Theorem.

Achim Blumensath

Theor. Comput. Sci., 2013

Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45].

Achim Blumensath

Theor. Comput. Sci., 2013

2012

Locality and modular Ehrenfeucht-Fraïssé games.

Achim Blumensath

J. Appl. Log., 2012

2011

Recognisability for algebras of infinite trees.

Achim Blumensath

Theor. Comput. Sci., 2011

Simple monadic theories and partition width.

Achim Blumensath

Math. Log. Q., 2011

Simple monadic theories and indiscernibles.

Achim Blumensath

Math. Log. Q., 2011

2010

On the Monadic Second-Order Transduction Hierarchy

Achim Blumensath, Bruno Courcelle

Log. Methods Comput. Sci., 2010

Guarded Second-Order Logic, Spanning Trees, and Network Flows

Achim Blumensath

Log. Methods Comput. Sci., 2010

2009

Boundedness of Monadic Second-Order Formulae over Finite Words.

Achim Blumensath, Martin Otto, Mark Weyer

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

On the structure of graphs in the Caucal hierarchy.

Achim Blumensath

Theor. Comput. Sci., 2008

Logical theories and compatible operations.

Achim Blumensath, Thomas Colcombet, Christof Löding

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2006

Recognizability, hypergraph operations, and logical types.

Achim Blumensath, Bruno Courcelle

Inf. Comput., 2006

A model-theoretic characterisation of clique width.

Achim Blumensath

Ann. Pure Appl. Log., 2006

2005

An Extension of Muchnik's Theorem.

Achim Blumensath, Stephan Kreutzer

J. Log. Comput., 2005

2004

Finite Presentations of Infinite Structures: Automata and Interpretations.

Achim Blumensath, Erich Grädel

Theory Comput. Syst., 2004

Axiomatising Tree-Interpretable Structures.

Achim Blumensath

Theory Comput. Syst., 2004

2003

Structures of bounded partition width.

Achim Blumensath

PhD thesis, 2003

2001

Automata for Guarded Fixed Point Logics.

Dietmar Berwanger, Achim Blumensath

Proceedings of the Automata, 2001

The Monadic Theory of Tree-like Structures.

Dietmar Berwanger, Achim Blumensath

Proceedings of the Automata, 2001

2000

Automatic Structures.

Achim Blumensath, Erich Grädel

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Bounded Arithmetic and Descriptive Complexity.

Achim Blumensath

Proceedings of the Computer Science Logic, 2000