Folgen
Achim Blumensath
Achim Blumensath
Zugehörigkeit unbekannt
Bestätigte E-Mail-Adresse bei mail.muni.cz
Titel
Zitiert von
Zitiert von
Jahr
Automatic structures
A Blumensath, E Gradel
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science …, 2000
4222000
Finite presentations of infinite structures: Automata and interpretations
A Blumensath, E Grädel
Theory of Computing Systems 37 (6), 641-674, 2004
1552004
Prefix-recognisable graphs and monadic second-order logic
A Blumensath
RWTH, Department of Computer Science, 2001
562001
Logical theories and compatible operations.
A Blumensath, T Colcombet, C Löding
Logic and automata 2, 73-106, 2008
452008
On the monadic second-order transduction hierarchy
B Courcelle, A Blumensath
Logical Methods in Computer Science 6, 2010
28*2010
On the structure of graphs in the Caucal hierarchy
A Blumensath
Theoretical Computer Science 400 (1-3), 19-45, 2008
262008
The monadic theory of tree-like structures
D Berwanger, A Blumensath
Automata Logics, and Infinite Games: A Guide to Current Research, 285-301, 2002
252002
Recognisability for algebras of infinite trees
A Blumensath
Theoretical computer science 412 (29), 3463-3486, 2011
212011
Recognizability, hypergraph operations, and logical types
A Blumensath, B Courcelle
Information and Computation 204 (6), 853-919, 2006
202006
Decidability results for the boundedness problem
M Weyer, M Otto, A Blumensath
Logical Methods in Computer Science 10, 2014
192014
Two-way cost automata and cost logics over infinite trees
A Blumensath, T Colcombet, D Kuperberg, P Parys, MV Boom
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
162014
Boundedness of monadic second-order formulae over finite words
A Blumensath, M Otto, M Weyer
Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009
152009
A model-theoretic characterisation of clique width
A Blumensath
Annals of Pure and Applied Logic 142 (1-3), 321-350, 2006
152006
An algebraic proof of Rabin’s Tree Theorem
A Blumensath
Theoretical Computer Science 478, 1-21, 2013
142013
An extension of Muchnik's theorem
A Bluemnsath, S Kreutzer
Journal of Logic and Computation 15 (1), 59-74, 2005
122005
Structures of bounded partition width
A Blumensath
Bibliothek der RWTH Aachen, 2003
122003
Axiomatising tree-interpretable structures
A Blumensath
STACS, 596-607, 2002
122002
Monadic second-order definable graph orderings
A Blumensath, B Courcelle
arXiv preprint arXiv:1310.8148, 2013
112013
Regular tree algebras
A Blumensath
Logical Methods in Computer Science 16, 2020
92020
Axiomatising tree-interpretable structures
A Blumensath
Theory of Computing Systems 37 (1), 3-27, 2004
92004
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20