Achim Blumensath

47 papers A* 2A 2B 2Journal 34Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Simple Classes of Automatic Structures.
Log. Methods Comput. Sci.
Achim Blumensath
2026 J jnl
The Expansion Problem for Infinite Trees.
Log. Methods Comput. Sci.
Achim Blumensath
2025 J jnl
Automata for Enriched Trees and Applications.
CoRR
Achim Blumensath
2025 J jnl
Categories for Automata and Language Theory (Dagstuhl Seminar 25141).
Dagstuhl Reports
Achim Blumensath, Mikolaj Bojanczyk, Bartek Klin, Daniela Petrisan
2025 J jnl
Simple Classes of Automatic Structures.
CoRR
Achim Blumensath
2024 J jnl
Some Remarks on First-Order Definable Tree Languages.
CoRR
Achim Blumensath
2023 J jnl
The Expansion Problem for Infinite Trees.
CoRR
Achim Blumensath
2023 J jnl
The Power-Set Construction for Tree Algebras.
Log. Methods Comput. Sci.
Achim Blumensath
2022 J jnl
The Power-Set Construction for Tree Algebras.
CoRR
Achim Blumensath
2022 J jnl
ω-Forest Algebras and Temporal Logics.
CoRR
Achim Blumensath, Jakub Lédl
2021 J jnl
Algebraic Language Theory for Eilenberg-Moore Algebras.
Log. Methods Comput. Sci.
Achim Blumensath
2021 B conf
ω-Forest Algebras and Temporal Logics.
MFCS
Achim Blumensath, Jakub Lédl
2020 J jnl
Algebraic Language Theory for Eilenberg-Moore Algebras.
CoRR
Achim Blumensath
2020 J jnl
Bisimulation invariant monadic-second order logic in the finite.
Theor. Comput. Sci.
Achim Blumensath, Felix Wolf
2020 J jnl
Regular Tree Algebras.
Log. Methods Comput. Sci.
Achim Blumensath
2019 J jnl
Bisimulation Invariant Monadic-Second Order Logic in the Finite.
CoRR
Achim Blumensath, Felix Wolf
2018 A* conf
Bisimulation Invariant Monadic-Second Order Logic in the Finite.
ICALP
Achim Blumensath, Felix Wolf
2018 J jnl
Branch-Continuous Tree Algebras.
CoRR
Achim Blumensath
2018 J jnl
Regular Tree Algebras.
CoRR
Achim Blumensath
2017 J jnl
A Compositional Coalgebraic Semantics of Strategic Games.
CoRR
Achim Blumensath, Viktor Winschel
2016 A conf
On a Fragment of AMSO and Tiling Systems.
STACS
Achim Blumensath, Thomas Colcombet, Pawel Parys
2014 — conf
Asymptotic Monadic Second-Order Logic.
MFCS (1)
Achim Blumensath, Olivier Carton, Thomas Colcombet
2014 J jnl
Decidability Results for the Boundedness Problem.
Log. Methods Comput. Sci.
Achim Blumensath, Martin Otto, Mark Weyer
2014 J jnl
Monadic second-order definable graph orderings.
Log. Methods Comput. Sci.
Achim Blumensath, Bruno Courcelle
2014 — conf
Two-way cost automata and cost logics over infinite trees.
CSL-LICS
Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
2013 J jnl
An algebraic proof of Rabin's Tree Theorem.
Theor. Comput. Sci.
Achim Blumensath
2013 J jnl
Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45].
Theor. Comput. Sci.
Achim Blumensath
2012 J jnl
Locality and modular Ehrenfeucht-Fraïssé games.
J. Appl. Log.
Achim Blumensath
2011 J jnl
Recognisability for algebras of infinite trees.
Theor. Comput. Sci.
Achim Blumensath
2011 J jnl
Simple monadic theories and indiscernibles.
Math. Log. Q.
Achim Blumensath
2011 J jnl
Simple monadic theories and partition width.
Math. Log. Q.
Achim Blumensath
2010 J jnl
Guarded Second-Order Logic, Spanning Trees, and Network Flows
Log. Methods Comput. Sci.
Achim Blumensath
2010 J jnl
On the Monadic Second-Order Transduction Hierarchy
Log. Methods Comput. Sci.
Achim Blumensath, Bruno Courcelle
2009 — conf
Boundedness of Monadic Second-Order Formulae over Finite Words.
ICALP (2)
Achim Blumensath, Martin Otto, Mark Weyer
2008 — conf
Logical theories and compatible operations.
Logic and Automata
Achim Blumensath, Thomas Colcombet, Christof Löding
2008 J jnl
On the structure of graphs in the Caucal hierarchy.
Theor. Comput. Sci.
Achim Blumensath
2006 J jnl
A model-theoretic characterisation of clique width.
Ann. Pure Appl. Log.
Achim Blumensath
2006 J jnl
Recognizability, hypergraph operations, and logical types.
Inf. Comput.
Achim Blumensath, Bruno Courcelle
2005 J jnl
An Extension of Muchnik's Theorem.
J. Log. Comput.
Achim Blumensath, Stephan Kreutzer
2004 J jnl
Axiomatising Tree-Interpretable Structures.
Theory Comput. Syst.
Achim Blumensath
2004 J jnl
Finite Presentations of Infinite Structures: Automata and Interpretations.
Theory Comput. Syst.
Achim Blumensath, Erich Grädel
2003 — —
Structures of bounded partition width.
Achim Blumensath
2002 A conf
Axiomatising Tree-Interpretable Structures.
STACS
Achim Blumensath
2001 — conf
Automata for Guarded Fixed Point Logics.
Automata, Logics, and Infinite Games
Dietmar Berwanger, Achim Blumensath
2001 — conf
The Monadic Theory of Tree-like Structures.
Automata, Logics, and Infinite Games
Dietmar Berwanger, Achim Blumensath
2000 A* conf
Automatic Structures.
LICS
Achim Blumensath, Erich Grädel
2000 B conf
Bounded Arithmetic and Descriptive Complexity.
CSL
Achim Blumensath