default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManfred Kufleitner
Person information
- affiliation: Loughborough University, Department of Computer Science, UK
- affiliation (former): University of Stuttgart, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i39]Jorge Almeida, Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for (ω - 1)-Terms over DAb. CoRR abs/2411.08523 (2024)- 2023
- [j22]Viktor Henriksson, Manfred Kufleitner
:
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words. Int. J. Found. Comput. Sci. 34(2&3): 183-224 (2023) - 2022
- [c34]Volker Diekert, Manfred Kufleitner:
Reachability Games and Parity Games. ICTAC 2022: 14-35 - [c33]Viktor Henriksson, Manfred Kufleitner:
Conelikes and Ranker Comparisons. LATIN 2022: 359-375 - [i38]Volker Diekert, Manfred Kufleitner:
Reachability Games and Parity Games. CoRR abs/2208.10121 (2022) - [i37]Manfred Kufleitner:
Yet another proof of Parikh's Theorem. CoRR abs/2210.02925 (2022) - 2021
- [c32]Viktor Henriksson, Manfred Kufleitner:
Deciding FO2 Alternation for Automata over Finite and Infinite Words. DLT 2021: 180-191 - [i36]Viktor Henriksson, Manfred Kufleitner:
Deciding FO2 Alternation for Automata over Finite and Infinite Words. CoRR abs/2105.09291 (2021) - [i35]Viktor Henriksson, Manfred Kufleitner:
Conelikes and Ranker Comparisons. CoRR abs/2105.09346 (2021) - [i34]Marcial Gaißert, Manfred Kufleitner:
The Inclusion Problem for Forest Languages under Substitutions. CoRR abs/2106.02571 (2021) - 2020
- [i33]Viktor Henriksson, Manfred Kufleitner:
Nesting negations in FO2 over infinite words. CoRR abs/2012.01309 (2020)
2010 – 2019
- 2019
- [j21]Lukas Fleischer, Manfred Kufleitner:
The complexity of weakly recognizing morphisms. RAIRO Theor. Informatics Appl. 53(1-2): 1-17 (2019) - [j20]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Deterministic Finite Automata. Theory Comput. Syst. 63(4): 666-687 (2019) - 2018
- [j19]Manfred Kufleitner, Tobias Walter:
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words. Theory Comput. Syst. 62(3): 467-480 (2018) - [j18]Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy. Theory Comput. Syst. 62(3): 682-738 (2018) - [c31]Lukas Fleischer, Manfred Kufleitner:
Testing Simon's congruence. MFCS 2018: 62:1-62:13 - [c30]Lukas Fleischer, Manfred Kufleitner:
The Intersection Problem for Finite Monoids. STACS 2018: 30:1-30:14 - [i32]Lukas Fleischer, Manfred Kufleitner:
Testing Simon's congruence. CoRR abs/1804.10459 (2018) - 2017
- [j17]Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
The Half-Levels of the FO2 Alternation Hierarchy. Theory Comput. Syst. 61(2): 352-370 (2017) - [c29]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Finite Transformation Semigroups. CSR 2017: 112-125 - [i31]Lukas Fleischer, Manfred Kufleitner:
Green's Relations in Finite Transformation Semigroups. CoRR abs/1703.04941 (2017) - [i30]Lukas Fleischer, Manfred Kufleitner:
The Intersection Problem for Finite Monoids. CoRR abs/1711.08717 (2017) - 2016
- [b4]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger, Ulrich Hertrampf:
Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups. de Gruyter 2016, ISBN 978-3-11-041332-8, pp. I-XII, 1-342 - [j16]Volker Diekert, Manfred Kufleitner:
A survey on the local divisor technique. Theor. Comput. Sci. 610: 13-23 (2016) - [c28]Manfred Kufleitner, Tobias Walter:
Level Two of the Quantifier Alternation Hierarchy over Infinite Words. CSR 2016: 223-236 - [c27]Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract). CSR 2016: 237-250 - [c26]Lukas Fleischer, Manfred Kufleitner:
Operations on Weakly Recognizing Morphisms. DCFS 2016: 126-137 - [c25]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations Over Partially Commutative Structures. ICALP 2016: 127:1-127:14 - [i29]Volker Diekert, Artur Jez, Manfred Kufleitner:
Solutions of Word Equations over Partially Commutative Structures. CoRR abs/1603.02966 (2016) - [i28]Lukas Fleischer, Manfred Kufleitner:
Operations on Weakly Recognizing Morphisms. CoRR abs/1603.05376 (2016) - 2015
- [j15]Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. Inf. Process. Lett. 115(4): 515-519 (2015) - [j14]Manfred Kufleitner, Tobias Walter:
One quantifier alternation in first-order logic with modular predicates. RAIRO Theor. Informatics Appl. 49(1): 1-22 (2015) - [j13]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. J. ACM 62(5): 39:1-39:20 (2015) - [j12]Volker Diekert, Manfred Kufleitner:
Omega-Rational Expressions with Bounded Synchronization Delay. Theory Comput. Syst. 56(4): 686-696 (2015) - [c24]Lukas Fleischer, Manfred Kufleitner:
Efficient Algorithms for Morphisms over Omega-Regular Languages. FSTTCS 2015: 112-124 - [i27]Manfred Kufleitner, Jan Philipp Wächter:
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy. CoRR abs/1509.05364 (2015) - [i26]Manfred Kufleitner, Tobias Walter:
Level Two of the Quantifier Alternation Hierarchy over Infinite Words. CoRR abs/1509.06207 (2015) - [i25]Lukas Fleischer, Manfred Kufleitner:
Efficient Algorithms for Morphisms over Omega-Regular Languages. CoRR abs/1509.06215 (2015) - 2014
- [c23]Lukas Fleischer, Manfred Kufleitner, Alexander Lauser:
Block Products and Nesting Negations in FO2. CSR 2014: 176-189 - [c22]Manfred Kufleitner:
Star-Free Languages and Local Divisors. DCFS 2014: 23-28 - [c21]Martin Huschenbett, Manfred Kufleitner:
Ehrenfeucht-Fraïssé Games on Omega-Terms. STACS 2014: 374-385 - [i24]Manfred Kufleitner:
Star-free languages and local divisors. CoRR abs/1408.2842 (2014) - [i23]Volker Diekert, Manfred Kufleitner:
A Survey on the Local Divisor Technique. CoRR abs/1410.6026 (2014) - [i22]Manfred Kufleitner, Jan Philipp Wächter:
Two-Variable Ehrenfeucht-Fraisse Games over Omega-Terms. CoRR abs/1411.0593 (2014) - 2013
- [b3]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände. De Gruyter Studium, de Gruyter 2013, ISBN 978-3-11-027767-8, pp. I-XI, 1-246 - [b2]Volker Diekert, Manfred Kufleitner, Gerhard Rosenberger:
Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen. De Gruyter Studium, de Gruyter 2013, ISBN 978-3-11-031260-7, pp. I-XI, 1-318 - [c20]Manfred Kufleitner, Alexander Lauser:
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. STACS 2013: 305-316 - [i21]Martin Huschenbett, Manfred Kufleitner:
Ehrenfeucht-Fraisse Games on Omega-Terms. CoRR abs/1310.3195 (2013) - [i20]Manfred Kufleitner, Tobias Walter:
One Quantifier Alternation in First-Order Logic with Modular Predicates. CoRR abs/1310.5043 (2013) - 2012
- [j11]Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi:
On Smoothed Analysis of Quicksort and Hoare's Find. Algorithmica 62(3-4): 879-905 (2012) - [j10]Manfred Kufleitner, Pascal Weil:
On logical hierarchies within FO2-definable languages. Log. Methods Comput. Sci. 8(3) (2012) - [j9]Manfred Kufleitner, Alexander Lauser:
The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. Discret. Math. Theor. Comput. Sci. 14(1): 141-146 (2012) - [j8]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
The Krohn-Rhodes Theorem and Local Divisors. Fundam. Informaticae 116(1-4): 65-77 (2012) - [j7]Manfred Kufleitner, Alexander Lauser:
Around dot-Depth One. Int. J. Found. Comput. Sci. 23(6): 1323-1340 (2012) - [j6]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454: 129-135 (2012) - [c19]Manfred Kufleitner, Pascal Weil:
The FO2 alternation hierarchy is decidable. CSL 2012: 426-439 - [c18]Volker Diekert, Manfred Kufleitner:
Bounded Synchronization Delay in Omega-Rational Expressions. CSR 2012: 89-98 - [c17]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages Are Church-Rosser Congruential. ICALP (2) 2012: 177-188 - [c16]Manfred Kufleitner, Alexander Lauser:
Lattices of Logical Fragments over Words - (Extended Abstract). ICALP (2) 2012: 275-286 - [c15]Manfred Kufleitner, Alexander Lauser:
The Join Levels of the Trotter-Weil Hierarchy Are Decidable. MFCS 2012: 603-614 - [c14]Franz Jahn, Manfred Kufleitner, Alexander Lauser:
Regular Ideal Languages and Their Boolean Combinations. CIAA 2012: 205-216 - [i19]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter:
Regular Languages are Church-Rosser Congruential. CoRR abs/1202.1148 (2012) - [i18]Manfred Kufleitner, Alexander Lauser:
Lattices of Logical Fragments over Words. CoRR abs/1202.3355 (2012) - [i17]Manfred Kufleitner, Pascal Weil:
The FO^2 alternation hierarchy is decidable. CoRR abs/1203.6152 (2012) - [i16]Manfred Kufleitner, Alexander Lauser:
The Join Levels of the Trotter-Weil Hierarchy are Decidable. CoRR abs/1204.4672 (2012) - [i15]Manfred Kufleitner, Alexander Lauser:
The Join of R-trivial and L-trivial Monoids via Combinatorics on Words. CoRR abs/1204.5368 (2012) - [i14]Manfred Kufleitner, Alexander Lauser:
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. CoRR abs/1212.6500 (2012) - 2011
- [j5]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-Way BüChi Automata. Int. J. Found. Comput. Sci. 22(8): 1861-1876 (2011) - [j4]Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. Theory Comput. Syst. 48(3): 486-516 (2011) - [c13]Manfred Kufleitner, Alexander Lauser:
Around Dot-Depth One. AFL 2011: 255-269 - [c12]Manfred Kufleitner, Alexander Lauser:
Languages of Dot-Depth One over Infinite Words. LICS 2011: 23-32 - [c11]Jakub Kallas, Manfred Kufleitner, Alexander Lauser:
First-order Fragments with Successor over Infinite Words. STACS 2011: 356-367 - [i13]Jakub Kallas, Manfred Kufleitner, Alexander Lauser:
First-order Fragments with Successor over Infinite Words. CoRR abs/1101.0115 (2011) - [i12]Manfred Kufleitner, Alexander Lauser:
Languages of Dot-depth One over Infinite Words. CoRR abs/1101.4152 (2011) - [i11]Manfred Kufleitner, Alexander Lauser:
Cantor Topologies for Finite Words. CoRR abs/1102.5013 (2011) - [i10]Manfred Kufleitner, Alexander Lauser:
Around Dot-depth One. CoRR abs/1103.1353 (2011) - [i9]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg:
The Krohn-Rhodes Theorem and Local Divisors. CoRR abs/1111.1585 (2011) - [i8]Volker Diekert, Manfred Kufleitner, Pascal Weil:
Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011) - 2010
- [c10]Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words - (Extended Abstract). Developments in Language Theory 2010: 148-159 - [c9]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-Way Büchi Automata. CIAA 2010: 181-190 - [i7]Luc Dartois, Manfred Kufleitner, Alexander Lauser:
Rankers over Infinite Words. CoRR abs/1005.0505 (2010) - [i6]Manfred Kufleitner, Alexander Lauser:
Partially Ordered Two-way Büchi Automata. CoRR abs/1006.2719 (2010)
2000 – 2009
- 2009
- [c8]Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi:
On Smoothed Analysis of Quicksort and Hoare's Find. COCOON 2009: 158-167 - [c7]Manfred Kufleitner, Pascal Weil:
On FO2 Quantifier Alternation over Words. MFCS 2009: 513-524 - [c6]Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. STACS 2009: 325-336 - [c5]Manfred Kufleitner:
On Bijective Variants of the Burrows-Wheeler Transform. Stringology 2009: 65-79 - [i5]Manfred Kufleitner, Pascal Weil:
On FO2 quantifier alternation over words. CoRR abs/0904.2894 (2009) - [i4]Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi:
On Smoothed Analysis of Quicksort and Hoare's Find. CoRR abs/0904.3898 (2009) - [i3]Volker Diekert, Manfred Kufleitner:
Fragments of first-order logic over infinite words. CoRR abs/0906.2995 (2009) - [i2]Manfred Kufleitner:
On Bijective Variants of the Burrows-Wheeler Transform. CoRR abs/0908.0239 (2009) - 2008
- [j3]Volker Diekert, Paul Gastin, Manfred Kufleitner:
A Survey on Small Fragments of First-Order Logic over Finite Words. Int. J. Found. Comput. Sci. 19(3): 513-548 (2008) - [c4]Manfred Kufleitner:
The Height of Factorization Forests. MFCS 2008: 443-454 - 2007
- [j2]Volker Diekert, Martin Horsch, Manfred Kufleitner:
On First-Order Fragments for Mazurkiewicz Traces. Fundam. Informaticae 80(1-3): 1-29 (2007) - [j1]Manfred Kufleitner:
Polynomials, fragments of temporal logic and the variety DA over traces. Theor. Comput. Sci. 376(1-2): 89-100 (2007) - [c3]Volker Diekert, Manfred Kufleitner:
On First-Order Fragments for Words and Mazurkiewicz Traces. Developments in Language Theory 2007: 1-19 - [i1]Manfred Kufleitner:
A Proof of the Factorization Forest Theorem. CoRR abs/0710.5130 (2007) - 2006
- [b1]Manfred Kufleitner:
Logical fragments for Mazurkiewicz traces: expressive power and algebraic characterizations. University of Stuttgart, 2006 - [c2]Manfred Kufleitner:
Polynomials, Fragments of Temporal Logic and the Variety DA over Traces. Developments in Language Theory 2006: 37-48 - 2002
- [c1]Volker Diekert, Manfred Kufleitner:
A Remark about Quadratic Trace Equations. Developments in Language Theory 2002: 59-66
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 2025-01-02 18:16 CET 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:
