#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2000

2018

- This year (3)
- Last 5 years (11)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Achim Blumensath, Erich Grädel
- LICS
- 2000

We study definability and complexity issues for automatic and ω-automaticstructures. These are, in general, infinite structures but they can be finitely presented by a collection of automata.… (More)

- Achim Blumensath, Erich Grädel
- Theory of Computing Systems
- 2004

We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus… (More)

- Achim Blumensath, Bruno Courcelle
- Logical Methods in Computer Science
- 2010

We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder C ⊑ K : iff C ⊆ τ(K) for some transduction τ . If we only consider… (More)

- Achim Blumensath, Martin Otto, Mark Weyer
- Logical Methods in Computer Science
- 2014

We prove decidability of the boundedness problem for monadic least fixedpoint recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula φ(X,x) that is positive… (More)

- Achim Blumensath, Bruno Courcelle
- Logical Methods in Computer Science
- 2013

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic… (More)

- Achim Blumensath
- 2001

We present several characterisations of the class of prefix-recognisable graphs including representations via graph-grammars and MSO-interpretations. The former implies that prefix-recognisable… (More)

- Achim Blumensath, Bruno Courcelle
- Inf. Comput.
- 2006

We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the… (More)

- Achim Blumensath
- Theor. Comput. Sci.
- 2013

Wecontinue the development of a theory of recognisability for infinite trees by introducing the equivalent of aWilke algebra. As an application we give a new proof of the decidability of the monadic… (More)

- Achim Blumensath, Stephan Kreutzer
- J. Log. Comput.
- 2005

One of the strongest decidability results in logic is the theorem of Muchnik which allows one to transfer the decidability of the monadic second-order theory of a structure to the decidability of the… (More)

- Achim Blumensath
- Theor. Comput. Sci.
- 2008

Recently Pawel Parys [3] pointed out an error in the article “On the structure of graphs in the Caucal hierarchy” [1], which contains two main results: Theorems 15 and 61. Theorem 61 is a pumping… (More)