Manfred Kufleitner

Int. J. Found. Comput. Sci., 2023

2022

Yet another proof of Parikh's Theorem.

[BibT_eX]

[DOI]

CoRR, 2022

Conelikes and Ranker Comparisons.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Reachability Games and Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

2021

The Inclusion Problem for Forest Languages under Substitutions.

[BibT_eX]

[DOI]

Marcial Gaißert

CoRR, 2021

Deciding FO2 Alternation for Automata over Finite and Infinite Words.

[BibT_eX]

[DOI]

CoRR, 2021

Deciding FO2 Alternation for Automata over Finite and Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020

Nesting negations in FO2 over infinite words.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Green's Relations in Deterministic Finite Automata.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

The complexity of weakly recognizing morphisms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2019

2018

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy.

[BibT_eX]

[DOI]

Jan Philipp Wächter

Theory Comput. Syst., 2018

Level Two of the Quantifier Alternation Hierarchy Over Infinite Words.

[BibT_eX]

[DOI]

Tobias Walter

Theory Comput. Syst., 2018

The Intersection Problem for Finite Monoids.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Testing Simon's congruence.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

The Half-Levels of the FO2 Alternation Hierarchy.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Green's Relations in Finite Transformation Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2017

2016

A survey on the local divisor technique.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Solutions of Word Equations Over Partially Commutative Structures.

[BibT_eX]

[DOI]

Artur Jez

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Operations on Weakly Recognizing Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract).

[BibT_eX]

[DOI]

Jan Philipp Wächter

Proceedings of the Computer Science - Theory and Applications, 2016

Discrete Algebraic Methods - Arithmetic, Cryptography, Automata and Groups.

[BibT_eX]

[DOI]

de Gruyter, ISBN: 978-3-11-041332-8, 2016

2015

Omega-Rational Expressions with Bounded Synchronization Delay.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Regular Languages Are Church-Rosser Congruential.

[BibT_eX]

[DOI]

J. ACM, 2015

One quantifier alternation in first-order logic with modular predicates.

[BibT_eX]

[DOI]

Tobias Walter

RAIRO Theor. Informatics Appl., 2015

On the index of Simon's congruence for piecewise testability.

[BibT_eX]

[DOI]

Prateek Karandikar

Philippe Schnoebelen

Inf. Process. Lett., 2015

Efficient Algorithms for Morphisms over Omega-Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Two-Variable Ehrenfeucht-Fraisse Games over Omega-Terms.

[BibT_eX]

[DOI]

Jan Philipp Wächter

CoRR, 2014

Ehrenfeucht-Fraïssé Games on Omega-Terms.

[BibT_eX]

[DOI]

Martin Huschenbett

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Star-Free Languages and Local Divisors.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

Block Products and Nesting Negations in FO2.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2014

2013

Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände.

[BibT_eX]

[DOI]

Gerhard Rosenberger

De Gruyter Studium, de Gruyter, ISBN: 978-3-11-027767-8, 2013

Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen.

[BibT_eX]

[DOI]

Gerhard Rosenberger

De Gruyter Studium, de Gruyter, ISBN: 978-3-11-031260-7, 2013

2012

Star-free languages are Church-Rosser congruential.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Around dot-Depth One.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

The Krohn-Rhodes Theorem and Local Divisors.

[BibT_eX]

[DOI]

Benjamin Steinberg

Fundam. Informaticae, 2012

The Join of R-trivial and L-trivial Monoids via Combinatorics on Words.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2012

On logical hierarchies within FO2-definable languages

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

The FO^2 alternation hierarchy is decidable

[BibT_eX]

[DOI]

CoRR, 2012

Lattices of Logical Fragments over Words

[BibT_eX]

[DOI]

CoRR, 2012

On Smoothed Analysis of Quicksort and Hoare's Find.

[BibT_eX]

[DOI]

Algorithmica, 2012

Regular Ideal Languages and Their Boolean Combinations.

[BibT_eX]

[DOI]

Franz Jahn

Proceedings of the Implementation and Application of Automata, 2012

The Join Levels of the Trotter-Weil Hierarchy Are Decidable.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Lattices of Logical Fragments over Words - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Bounded Synchronization Delay in Omega-Rational Expressions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

The FO2 alternation hierarchy is decidable.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic (CSL'12), 2012

2011

Fragments of First-Order Logic over Infinite Words.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Partially Ordered Two-Way BüChi Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Cantor Topologies for Finite Words

[BibT_eX]

[DOI]

CoRR, 2011

First-order Fragments with Successor over Infinite Words.

[BibT_eX]

[DOI]

Jakub Kallas

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Languages of Dot-Depth One over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

Rankers over Infinite Words

[BibT_eX]

[DOI]

Luc Dartois

CoRR, 2010

Rankers over Infinite Words - (Extended Abstract).

[BibT_eX]

[DOI]

Luc Dartois

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

On Bijective Variants of the Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

On FO2 Quantifier Alternation over Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

A Survey on Small Fragments of First-Order Logic over Finite Words.

[BibT_eX]

[DOI]

Paul Gastin

Int. J. Found. Comput. Sci., 2008

The Height of Factorization Forests.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Polynomials, fragments of temporal logic and the variety DA over traces.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On First-Order Fragments for Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Martin Horsch

Fundam. Informaticae, 2007

A Proof of the Factorization Forest Theorem

[BibT_eX]

[DOI]

CoRR, 2007

On First-Order Fragments for Words and Mazurkiewicz Traces.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

Logical fragments for Mazurkiewicz traces: expressive power and algebraic characterizations.

[BibT_eX]

[DOI]

PhD thesis, 2006

2002

A Remark about Quadratic Trace Equations.

[BibT_eX]

[DOI]