Achim Blumensath - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2023

The Power-Set Construction for Tree AlgebrasAchim Blumensath. lmcs, 19(4), 2023. [doi]

2021

Algebraic Language Theory for Eilenberg-Moore AlgebrasAchim Blumensath. lmcs, 17(2), 2021. [doi]

ω-Forest Algebras and Temporal LogicsAchim Blumensath, Jakub Lédl. mfcs 2021: [doi]

2020

Bisimulation invariant monadic-second order logic in the finiteAchim Blumensath, Felix Wolf 0002. TCS, 823:26-43, 2020. [doi]

Regular Tree AlgebrasAchim Blumensath. lmcs, 16(1), 2020. [doi]

2018

Bisimulation Invariant Monadic-Second Order Logic in the FiniteAchim Blumensath, Felix Wolf 0002. icalp 2018: [doi]

2016

On a Fragment of AMSO and Tiling SystemsAchim Blumensath, Thomas Colcombet, Pawel Parys. STACS 2016: [doi]

2014

Asymptotic Monadic Second-Order LogicAchim Blumensath, Olivier Carton, Thomas Colcombet. mfcs 2014: 87-98 [doi]

Two-way cost automata and cost logics over infinite treesAchim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom. csl 2014: 16 [doi]

2013

An algebraic proof of Rabin's Tree TheoremAchim Blumensath. TCS, 478:1-21, 2013. [doi]

Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]Achim Blumensath. TCS, 475:126-127, 2013. [doi]

2012

Locality and modular Ehrenfeucht-Fraïssé gamesAchim Blumensath. japll, 10(1):144-162, 2012. [doi]

2011

Simple monadic theories and partition widthAchim Blumensath. mlq, 57(4):409-431, 2011. [doi]

Recognisability for algebras of infinite treesAchim Blumensath. TCS, 412(29):3463-3486, 2011. [doi]

Simple monadic theories and indiscerniblesAchim Blumensath. mlq, 57(1):65-86, 2011. [doi]

2009

Boundedness of Monadic Second-Order Formulae over Finite WordsAchim Blumensath, Martin Otto, Mark Weyer. icalp 2009: 67-78 [doi]

2008

On the structure of graphs in the Caucal hierarchyAchim Blumensath. TCS, 400(1-3):19-45, 2008. [doi]

Logical theories and compatible operationsAchim Blumensath, Thomas Colcombet, Christof Löding. BIRTHDAY 2008: 73-106

2006

A model-theoretic characterisation of clique widthAchim Blumensath. APAL, 142(1-3):321-350, 2006. [doi]

Recognizability, hypergraph operations, and logical typesAchim Blumensath, Bruno Courcelle. iandc, 204(6):853-919, 2006. [doi]

2004

Axiomatising Tree-Interpretable StructuresAchim Blumensath. mst, 37(1):3-27, 2004. [doi]

Finite Presentations of Infinite Structures: Automata and InterpretationsAchim Blumensath, Erich Grädel. mst, 37(6):641-674, 2004. [doi]

2003

Structures of bounded partition widthAchim Blumensath. PhD thesis, RWTH Aachen University, 2003. [doi]

2002

Axiomatising Tree-Interpretable StructuresAchim Blumensath. STACS 2002: 596-607 [doi]

2001

Automata for Guarded Fixed Point LogicsDietmar Berwanger, Achim Blumensath. Dagstuhl 2002: 343-355 [doi]

The Monadic Theory of Tree-like StructuresDietmar Berwanger, Achim Blumensath. Dagstuhl 2002: 285-302 [doi]

2000

Bounded Arithmetic and Descriptive ComplexityAchim Blumensath. csl 2000: 232-246 [doi]

Automatic StructuresAchim Blumensath, Erich Grädel. lics 2000: 51-62 [doi]

Sign in or sign up to see more results.

runs on WebDSL