| Computational complexity of synchronization under regular constraints H Fernau, VV Gusev, S Hoffmann, M Holzer, MV Volkov, P Wolf 44th International Symposium on Mathematical Foundations of Computer Science …, 2019 | 19 | 2019 |
| Extensions to Minimal Synchronizing Words. H Fernau, S Hoffmann J. Autom. Lang. Comb. 24 (2-4), 287-307, 2019 | 18 | 2019 |
| Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words S Hoffmann International Conference on Language and Automata Theory and Applications …, 2021 | 14 | 2021 |
| State complexity bounds for the commutative closure of group languages S Hoffmann International Conference on Descriptional Complexity of Formal Systems, 64-77, 2020 | 10 | 2020 |
| Commutative regular languages–properties and state complexity S Hoffmann International Conference on Algebraic Informatics, 151-163, 2019 | 10 | 2019 |
| State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets S Hoffmann International Conference on Language and Automata Theory and Applications …, 2021 | 8 | 2021 |
| Shift-invariant topologies for the Cantor space Xω S Hoffmann, S Schwarz, L Staiger Theoretical Computer Science 679, 145-161, 2017 | 8 | 2017 |
| Computational complexity of synchronization under regular commutative constraints S Hoffmann International Computing and Combinatorics Conference, 460-471, 2020 | 7 | 2020 |
| Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata S Hoffmann International Conference on Developments in Language Theory, 204-216, 2021 | 6 | 2021 |
| State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters S Hoffmann International Conference on Developments in Language Theory, 192-203, 2021 | 6 | 2021 |
| On a class of constrained synchronization problems in NP S Hoffmann arXiv preprint arXiv:2006.01903, 2020 | 6 | 2020 |
| Subword metrics for infinite words S Hoffmann, L Staiger International Conference on Implementation and Application of Automata, 165-175, 2015 | 6 | 2015 |
| State complexity, properties and generalizations of commutative regular languages S Hoffmann Inf. Comput.(submitted), 0 | 4 | |
| Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata S Hoffmann International Computing and Combinatorics Conference, 176-188, 2021 | 3 | 2021 |
| Computational Complexity of Synchronization Under Sparse Regular Constraints S Hoffmann International Symposium on Fundamentals of Computation Theory, 272-286, 2021 | 3 | 2021 |
| Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited H Fernau, S Hoffmann, M Wehar arXiv preprint arXiv:2108.05244, 2021 | 3 | 2021 |
| Metriken zur Verfeinerung des Cantor-Raumes auf Xω S Hoffmann Diploma thesis, Martin-Luther-Universität Halle-Wittenberg, 2014 | 3 | 2014 |
| State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints S Hoffmann International Conference on Implementation and Application of Automata, 115-126, 2021 | 2 | 2021 |
| The Commutative Closure of Shuffle Languages over Group Languages is Regular S Hoffmann International Conference on Implementation and Application of Automata, 53-64, 2021 | 1 | 2021 |
| Constraint Synchronization with Two or Three State Partial Constraint Automata S Hoffmann arXiv e-prints, arXiv: 2005.05907, 2020 | 1 | 2020 |
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
