A Remark about Quadratic Trace Equations. - Volker Diekert; Manfred Kufleitner (Developments in Language Theory, 2002)

Logical fragments for Mazurkiewicz traces: expressive power and algebraic characterizations. - Manfred Kufleitner (2006)

On First-Order Fragments for Words and Mazurkiewicz Traces. - Volker Diekert; Manfred Kufleitner (Developments in Language Theory, 2007)

A Proof of the Factorization Forest Theorem - Manfred Kufleitner (CoRR, 2007)

On First-Order Fragments for Mazurkiewicz Traces. - Volker Diekert; Martin Horsch; Manfred Kufleitner (Fundam. Informaticae, 2007)

Polynomials, fragments of temporal logic and the variety DA over traces. - Manfred Kufleitner (Theor. Comput. Sci., 2007)

The Height of Factorization Forests. - Manfred Kufleitner (MFCS, 2008)

A Survey on Small Fragments of First-Order Logic over Finite Words. - Volker Diekert; Paul Gastin; Manfred Kufleitner (Int. J. Found. Comput. Sci., 2008)

On FO2 Quantifier Alternation over Words. - Manfred Kufleitner; Pascal Weil (MFCS, 2009)

On Bijective Variants of the Burrows-Wheeler Transform. - Manfred Kufleitner (Stringology, 2009)

Rankers over Infinite Words - (Extended Abstract). - Luc Dartois; Manfred Kufleitner; Alexander Lauser (Developments in Language Theory, 2010)

Rankers over Infinite Words - Luc Dartois; Manfred Kufleitner; Alexander Lauser (CoRR, 2010)

Languages of Dot-Depth One over Infinite Words. - Manfred Kufleitner; Alexander Lauser (LICS, 2011)

First-order Fragments with Successor over Infinite Words. - Jakub Kallas; Manfred Kufleitner; Alexander Lauser (STACS, 2011)

Cantor Topologies for Finite Words - Manfred Kufleitner; Alexander Lauser (CoRR, 2011)

Partially Ordered Two-Way BüChi Automata. - Manfred Kufleitner; Alexander Lauser (Int. J. Found. Comput. Sci., 2011)

Fragments of First-Order Logic over Infinite Words. - Volker Diekert; Manfred Kufleitner (Theory Comput. Syst., 2011)

The FO2 alternation hierarchy is decidable. - Manfred Kufleitner; Pascal Weil (CSL, 2012)

Bounded Synchronization Delay in Omega-Rational Expressions. - Volker Diekert; Manfred Kufleitner (CSR, 2012)

Lattices of Logical Fragments over Words - (Extended Abstract). - Manfred Kufleitner; Alexander Lauser (ICALP (2), 2012)

The Join Levels of the Trotter-Weil Hierarchy Are Decidable. - Manfred Kufleitner; Alexander Lauser (MFCS, 2012)

Regular Ideal Languages and Their Boolean Combinations. - Franz Jahn; Manfred Kufleitner; Alexander Lauser (CIAA, 2012)

On Smoothed Analysis of Quicksort and Hoare's Find. - Mahmoud Fouz; Manfred Kufleitner; Bodo Manthey; Nima Zeini Jahromi (Algorithmica, 2012)

Lattices of Logical Fragments over Words - Manfred Kufleitner; Alexander Lauser (CoRR, 2012)

The FO^2 alternation hierarchy is decidable - Manfred Kufleitner; Pascal Weil (CoRR, 2012)

On logical hierarchies within FO2-definable languages - Manfred Kufleitner; Pascal Weil (Log. Methods Comput. Sci., 2012)

The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. - Manfred Kufleitner; Alexander Lauser (Discret. Math. Theor. Comput. Sci., 2012)

The Krohn-Rhodes Theorem and Local Divisors. - Volker Diekert; Manfred Kufleitner; Benjamin Steinberg (Fundam. Informaticae, 2012)

Around dot-Depth One. - Manfred Kufleitner; Alexander Lauser (Int. J. Found. Comput. Sci., 2012)

Star-free languages are Church-Rosser congruential. - Volker Diekert; Manfred Kufleitner; Pascal Weil (Theor. Comput. Sci., 2012)

Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen. - Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger (de Gruyter, 2013)

Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände. - Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger (de Gruyter, 2013)

Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. - Manfred Kufleitner; Alexander Lauser (STACS, 2013)

Block Products and Nesting Negations in FO2. - Lukas Fleischer; Manfred Kufleitner; Alexander Lauser (CSR, 2014)

Star-Free Languages and Local Divisors. - Manfred Kufleitner (DCFS, 2014)

Ehrenfeucht-Fraïssé Games on Omega-Terms. - Martin Huschenbett; Manfred Kufleitner (STACS, 2014)

Two-Variable Ehrenfeucht-Fraisse Games over Omega-Terms. - Manfred Kufleitner; Jan Philipp Wächter (CoRR, 2014)

Efficient Algorithms for Morphisms over Omega-Regular Languages. - Lukas Fleischer; Manfred Kufleitner (FSTTCS, 2015)

On the index of Simon's congruence for piecewise testability. - Prateek Karandikar; Manfred Kufleitner; Philippe Schnoebelen (Inf. Process. Lett., 2015)

One quantifier alternation in first-order logic with modular predicates. - Manfred Kufleitner; Tobias Walter (RAIRO Theor. Informatics Appl., 2015)

Regular Languages Are Church-Rosser Congruential. - Volker Diekert; Manfred Kufleitner; Klaus Reinhardt; Tobias Walter (J. ACM, 2015)

Omega-Rational Expressions with Bounded Synchronization Delay. - Volker Diekert; Manfred Kufleitner (Theory Comput. Syst., 2015)

Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups. - Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger; Ulrich Hertrampf (de Gruyter, 2016)

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract). - Manfred Kufleitner; Jan Philipp Wächter (CSR, 2016)

Operations on Weakly Recognizing Morphisms. - Lukas Fleischer; Manfred Kufleitner (DCFS, 2016)

Solutions of Word Equations Over Partially Commutative Structures. - Volker Diekert; Artur Jez; Manfred Kufleitner (ICALP, 2016)

A survey on the local divisor technique. - Volker Diekert; Manfred Kufleitner (Theor. Comput. Sci., 2016)

Green's Relations in Finite Transformation Semigroups. - Lukas Fleischer; Manfred Kufleitner (CSR, 2017)

The Half-Levels of the FO2 Alternation Hierarchy. - Lukas Fleischer; Manfred Kufleitner; Alexander Lauser (Theory Comput. Syst., 2017)

Testing Simon's congruence. - Lukas Fleischer; Manfred Kufleitner (MFCS, 2018)

The Intersection Problem for Finite Monoids. - Lukas Fleischer; Manfred Kufleitner (STACS, 2018)

Level Two of the Quantifier Alternation Hierarchy Over Infinite Words. - Manfred Kufleitner; Tobias Walter (Theory Comput. Syst., 2018)

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy. - Manfred Kufleitner; Jan Philipp Wächter (Theory Comput. Syst., 2018)

The complexity of weakly recognizing morphisms. - Lukas Fleischer; Manfred Kufleitner (RAIRO Theor. Informatics Appl., 2019)

Green's Relations in Deterministic Finite Automata. - Lukas Fleischer; Manfred Kufleitner (Theory Comput. Syst., 2019)

Nesting negations in FO2 over infinite words. - Viktor Henriksson; Manfred Kufleitner (CoRR, 2020)

Deciding FO2 Alternation for Automata over Finite and Infinite Words. - Viktor Henriksson; Manfred Kufleitner (DLT, 2021)

Deciding FO2 Alternation for Automata over Finite and Infinite Words. - Viktor Henriksson; Manfred Kufleitner (CoRR, 2021)

The Inclusion Problem for Forest Languages under Substitutions. - Marcial Gaißert; Manfred Kufleitner (CoRR, 2021)

Reachability Games and Parity Games. - Volker Diekert; Manfred Kufleitner (ICTAC, 2022)

Conelikes and Ranker Comparisons. - Viktor Henriksson; Manfred Kufleitner (LATIN, 2022)

Yet another proof of Parikh's Theorem. - Manfred Kufleitner (CoRR, 2022)

Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words. - Viktor Henriksson; Manfred Kufleitner (Int. J. Found. Comput. Sci., 2023)

The Word Problem for (ω - 1)-Terms over DAb. - Jorge Almeida 001; Manfred Kufleitner; Jan Philipp Wächter (CoRR, 2024)