Subword Metrics for Infinite Words. - Stefan Hoffmann 001; Ludwig Staiger (CIAA, 2015)

Shift-invariant topologies for the Cantor space Xω. - Stefan Hoffmann 001; Sibylle Schwarz; Ludwig Staiger (Theor. Comput. Sci., 2017)

Commutative Regular Languages - Properties and State Complexity. - Stefan Hoffmann 001 (CAI, 2019)

Computational Complexity of Synchronization under Regular Constraints. - Henning Fernau; Vladimir V. Gusev; Stefan Hoffmann 001; Markus Holzer 001; Mikhail V. Volkov 001; Petra Wolf 002 (MFCS, 2019)

Extensions to Minimal Synchronizing Words. - Henning Fernau; Stefan Hoffmann 001 (J. Autom. Lang. Comb., 2019)

Computational Complexity of Synchronization Under Regular Commutative Constraints. - Stefan Hoffmann 001 (COCOON, 2020)

On A Class of Constrained Synchronization Problems in NP. - Stefan Hoffmann 001 (ICTCS, 2020)

Constraint Synchronization with Two or Three State Partial Constraint Automata. - Stefan Hoffmann 001 (CoRR, 2020)

State Complexity of Permutation on Finite Languages. - Stefan Hoffmann 001 (CoRR, 2020)

State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages. - Stefan Hoffmann 001 (CoRR, 2020)

Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata. - Stefan Hoffmann 001 (COCOON, 2021)

Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. - Stefan Hoffmann 001 (DCFS, 2021)

Commutative Regular Languages with Product-Form Minimal Automata. - Stefan Hoffmann 001 (DCFS, 2021)

State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. - Stefan Hoffmann 001 (DCFS, 2021)

State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. - Stefan Hoffmann 001 (DLT, 2021)

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. - Stefan Hoffmann 001 (DLT, 2021)

Computational Complexity of Synchronization Under Sparse Regular Constraints. - Stefan Hoffmann 001 (FCT, 2021)

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. - Emmanuel Arrighi; Henning Fernau; Stefan Hoffmann 001; Markus Holzer 001; Ismaël Jecker; Mateus de Oliveira Oliveira; Petra Wolf 002 (FSTTCS, 2021)

Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. - Stefan Hoffmann 001 (LATA, 2021)

State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. - Stefan Hoffmann 001 (LATA, 2021)

The Commutative Closure of Shuffle Languages over Group Languages is Regular. - Stefan Hoffmann 001 (CIAA, 2021)

State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints. - Stefan Hoffmann 001 (CIAA, 2021)

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. - Henning Fernau; Stefan Hoffmann 001; Michael Wehar (CoRR, 2021)

Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents. - Stefan Hoffmann 001 (CoRR, 2021)

Constrained synchronization and commutativity. - Stefan Hoffmann 001 (Theor. Comput. Sci., 2021)

Reset Complexity and Completely Reachable Automata with Simple Idempotents. - Stefan Hoffmann 001 (DCFS, 2022)

Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages. - Stefan Hoffmann 001 (DLT, 2022)

The Synchronization Game on Subclasses of Automata. - Henning Fernau; Carolina Haase; Stefan Hoffmann 001 (FUN, 2022)

Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents. - Stefan Hoffmann 001 (CIAA, 2022)

Synchronization of Parikh Automata. - Stefan Hoffmann 001 (DLT, 2023)

Completely Distinguishable Automata and the Set of Synchronizing Words. - Stefan Hoffmann 001 (DLT, 2023)

State Complexity Bounds for the Commutative Closure of Group Languages. - Stefan Hoffmann 001 (J. Autom. Lang. Comb., 2023)

Binary and circular automata having maximal state complexity for the set of synchronizing words. - Stefan Hoffmann 001 (Inf. Comput., 2023)

New characterizations of primitive permutation groups with applications to synchronizing automata. - Stefan Hoffmann 001 (Inf. Comput., 2023)

Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. - Stefan Hoffmann 001 (Int. J. Found. Comput. Sci., 2023)

State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs. - Stefan Hoffmann 001 (Int. J. Found. Comput. Sci., 2023)

Automata Classes Accepting Languages Whose Commutative Closure is Regular. - Stefan Hoffmann 001 (SOFSEM, 2024)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. - Henning Fernau; Carolina Haase; Stefan Hoffmann 001; Mikhail Volkov 001 (NCMA, 2024)

State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages. - Stefan Hoffmann 001 (Inf. Comput., 2024)

The n-ary initial literal and literal shuffle. - Stefan Hoffmann 001 (Discret. Appl. Math., 2025)