Lukas Fleischer

Theory Comput., 2022

2021

Automata, Palindromes, and Reversed Subwords.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2021

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

2020

New bounds on antipowers in words.

[BibT_eX]

[DOI]

Samin Riasat

Inf. Process. Lett., 2020

The Intersection Problem for Finite Semigroups.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

The complexity of properties of transformation semigroups.

[BibT_eX]

[DOI]

Trevor Jack

Int. J. Algebra Comput., 2020

The State Complexity of Lexicographically Smallest Words and Computing Successors.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 24th International Conference, 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

New Bounds on Antipowers in Binary Words.

[BibT_eX]

[DOI]

Samin Riasat

CoRR, 2019

Words With Few Palindromes, Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

Words Avoiding Reversed Factors, Revisited.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Efficient Membership Testing for Pseudovarieties of Finite Semigroups.

[BibT_eX]

[DOI]

CoRR, 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

On the Complexity of the Cayley Semigroup Membership Problem.

[BibT_eX]

[DOI]

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

The Half-Levels of the FO2 Alternation Hierarchy.

[BibT_eX]

[DOI]

Alexander Lauser

Theory Comput. Syst., 2017

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.

[BibT_eX]

[DOI]

Volker Diekert

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

Green's Relations in Finite Transformation Semigroups.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2017

2016

Operations on Weakly Recognizing Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

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

Block Products and Nesting Negations in FO2.

[BibT_eX]

[DOI]