default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchim Blumensath
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]Achim Blumensath:
Structures of bounded partition width. RWTH Aachen University, Germany, 2003, pp. 1-199
Journal Articles
- 2023
- [j20]Achim Blumensath:
The Power-Set Construction for Tree Algebras. Log. Methods Comput. Sci. 19(4) (2023) - 2021
- [j19]Achim Blumensath:
Algebraic Language Theory for Eilenberg-Moore Algebras. Log. Methods Comput. Sci. 17(2) (2021) - 2020
- [j18]Achim Blumensath:
Regular Tree Algebras. Log. Methods Comput. Sci. 16(1) (2020) - [j17]Achim Blumensath, Felix Wolf:
Bisimulation invariant monadic-second order logic in the finite. Theor. Comput. Sci. 823: 26-43 (2020) - 2014
- [j16]Achim Blumensath, Bruno Courcelle:
Monadic second-order definable graph orderings. Log. Methods Comput. Sci. 10(1) (2014) - [j15]Achim Blumensath, Martin Otto, Mark Weyer:
Decidability Results for the Boundedness Problem. Log. Methods Comput. Sci. 10(3) (2014) - 2013
- [j14]Achim Blumensath:
Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]. Theor. Comput. Sci. 475: 126-127 (2013) - [j13]Achim Blumensath:
An algebraic proof of Rabin's Tree Theorem. Theor. Comput. Sci. 478: 1-21 (2013) - 2012
- [j12]Achim Blumensath:
Locality and modular Ehrenfeucht-Fraïssé games. J. Appl. Log. 10(1): 144-162 (2012) - 2011
- [j11]Achim Blumensath:
Simple monadic theories and indiscernibles. Math. Log. Q. 57(1): 65-86 (2011) - [j10]Achim Blumensath:
Simple monadic theories and partition width. Math. Log. Q. 57(4): 409-431 (2011) - [j9]Achim Blumensath:
Recognisability for algebras of infinite trees. Theor. Comput. Sci. 412(29): 3463-3486 (2011) - 2010
- [j8]Achim Blumensath:
Guarded Second-Order Logic, Spanning Trees, and Network Flows. Log. Methods Comput. Sci. 6(1) (2010) - [j7]Achim Blumensath, Bruno Courcelle:
On the Monadic Second-Order Transduction Hierarchy. Log. Methods Comput. Sci. 6(2) (2010) - 2008
- [j6]Achim Blumensath:
On the structure of graphs in the Caucal hierarchy. Theor. Comput. Sci. 400(1-3): 19-45 (2008) - 2006
- [j5]Achim Blumensath:
A model-theoretic characterisation of clique width. Ann. Pure Appl. Log. 142(1-3): 321-350 (2006) - [j4]Achim Blumensath, Bruno Courcelle:
Recognizability, hypergraph operations, and logical types. Inf. Comput. 204(6): 853-919 (2006) - 2005
- [j3]Achim Blumensath, Stephan Kreutzer:
An Extension of Muchnik's Theorem. J. Log. Comput. 15(1): 59-74 (2005) - 2004
- [j2]Achim Blumensath:
Axiomatising Tree-Interpretable Structures. Theory Comput. Syst. 37(1): 3-27 (2004) - [j1]Achim Blumensath, Erich Grädel:
Finite Presentations of Infinite Structures: Automata and Interpretations. Theory Comput. Syst. 37(6): 641-674 (2004)
Conference and Workshop Papers
- 2021
- [c12]Achim Blumensath, Jakub Lédl:
ω-Forest Algebras and Temporal Logics. MFCS 2021: 19:1-19:21 - 2018
- [c11]Achim Blumensath, Felix Wolf
:
Bisimulation Invariant Monadic-Second Order Logic in the Finite. ICALP 2018: 117:1-117:13 - 2016
- [c10]Achim Blumensath, Thomas Colcombet, Pawel Parys:
On a Fragment of AMSO and Tiling Systems. STACS 2016: 19:1-19:14 - 2014
- [c9]Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. CSL-LICS 2014: 16:1-16:9 - [c8]Achim Blumensath, Olivier Carton, Thomas Colcombet:
Asymptotic Monadic Second-Order Logic. MFCS (1) 2014: 87-98 - 2009
- [c7]Achim Blumensath, Martin Otto, Mark Weyer:
Boundedness of Monadic Second-Order Formulae over Finite Words. ICALP (2) 2009: 67-78 - 2008
- [c6]Achim Blumensath, Thomas Colcombet, Christof Löding:
Logical theories and compatible operations. Logic and Automata 2008: 73-106 - 2002
- [c5]Achim Blumensath:
Axiomatising Tree-Interpretable Structures. STACS 2002: 596-607 - 2001
- [c4]Dietmar Berwanger, Achim Blumensath:
The Monadic Theory of Tree-like Structures. Automata, Logics, and Infinite Games 2001: 285-302 - [c3]Dietmar Berwanger, Achim Blumensath:
Automata for Guarded Fixed Point Logics. Automata, Logics, and Infinite Games 2001: 343-355 - 2000
- [c2]Achim Blumensath:
Bounded Arithmetic and Descriptive Complexity. CSL 2000: 232-246 - [c1]Achim Blumensath, Erich Grädel:
Automatic Structures. LICS 2000: 51-62
Informal and Other Publications
- 2024
- [i9]Achim Blumensath:
Some Remarks on First-Order Definable Tree Languages. CoRR abs/2407.01169 (2024) - 2023
- [i8]Achim Blumensath:
The Expansion Problem for Infinite Trees. CoRR abs/2308.01174 (2023) - 2022
- [i7]Achim Blumensath, Jakub Lédl:
ω-Forest Algebras and Temporal Logics. CoRR abs/2203.13858 (2022) - [i6]Achim Blumensath:
The Power-Set Construction for Tree Algebras. CoRR abs/2207.00563 (2022) - 2020
- [i5]Achim Blumensath:
Algebraic Language Theory for Eilenberg-Moore Algebras. CoRR abs/2006.08316 (2020) - 2019
- [i4]Achim Blumensath, Felix Wolf:
Bisimulation Invariant Monadic-Second Order Logic in the Finite. CoRR abs/1905.06668 (2019) - 2018
- [i3]Achim Blumensath:
Branch-Continuous Tree Algebras. CoRR abs/1807.04568 (2018) - [i2]Achim Blumensath:
Regular Tree Algebras. CoRR abs/1808.03559 (2018) - 2017
- [i1]Achim Blumensath, Viktor Winschel:
A Compositional Coalgebraic Semantics of Strategic Games. CoRR abs/1712.08381 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
