Stefan Hoffmann

According to our database, Stefan Hoffmann authored at least 40 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages.

Stefan Hoffmann

Inf. Comput., 2024

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata.

Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

Automata Classes Accepting Languages Whose Commutative Closure is Regular.

Stefan Hoffmann

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.

Stefan Hoffmann

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

Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.

Stefan Hoffmann

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

New characterizations of primitive permutation groups with applications to synchronizing automata.

Stefan Hoffmann

Inf. Comput., December, 2023

Binary and circular automata having maximal state complexity for the set of synchronizing words.

Stefan Hoffmann

Inf. Comput., December, 2023

State Complexity Bounds for the Commutative Closure of Group Languages.

Stefan Hoffmann

J. Autom. Lang. Comb., 2023

Completely Distinguishable Automata and the Set of Synchronizing Words.

Stefan Hoffmann

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Synchronization of Parikh Automata.

Stefan Hoffmann

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022

Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents.

Stefan Hoffmann

Proceedings of the Implementation and Application of Automata, 2022

The Synchronization Game on Subclasses of Automata.

Henning Fernau, Carolina Haase, Stefan Hoffmann

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages.

Stefan Hoffmann

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Reset Complexity and Completely Reachable Automata with Simple Idempotents.

Stefan Hoffmann

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Constrained synchronization and commutativity.

Stefan Hoffmann

Theor. Comput. Sci., 2021

Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents.

Stefan Hoffmann

CoRR, 2021

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.

Henning Fernau, Stefan Hoffmann, Michael Wehar

CoRR, 2021

State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints.

Stefan Hoffmann

Proceedings of the Implementation and Application of Automata, 2021

The Commutative Closure of Shuffle Languages over Group Languages is Regular.

Stefan Hoffmann

Proceedings of the Implementation and Application of Automata, 2021

The n-ary Initial Literal and Literal Shuffle.

Stefan Hoffmann

Proceedings of the Prague Stringology Conference 2021, 2021

State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.

Stefan Hoffmann

Proceedings of the Language and Automata Theory and Applications, 2021

Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.

Stefan Hoffmann

Proceedings of the Language and Automata Theory and Applications, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Computational Complexity of Synchronization Under Sparse Regular Constraints.

Stefan Hoffmann

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.

Stefan Hoffmann

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

State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.

Stefan Hoffmann

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

State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages.

Stefan Hoffmann

Proceedings of the Descriptional Complexity of Formal Systems, 2021

Commutative Regular Languages with Product-Form Minimal Automata.

Stefan Hoffmann

Proceedings of the Descriptional Complexity of Formal Systems, 2021

Sync-Maximal Permutation Groups Equal Primitive Permutation Groups.

Stefan Hoffmann

Proceedings of the Descriptional Complexity of Formal Systems, 2021

Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata.

Stefan Hoffmann

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages.

Stefan Hoffmann

CoRR, 2020

State Complexity of Permutation on Finite Languages.

Stefan Hoffmann

CoRR, 2020

Constraint Synchronization with Two or Three State Partial Constraint Automata.

Stefan Hoffmann

CoRR, 2020

On A Class of Constrained Synchronization Problems in NP.

Stefan Hoffmann

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Computational Complexity of Synchronization Under Regular Commutative Constraints.

Stefan Hoffmann

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Extensions to Minimal Synchronizing Words.

Henning Fernau, Stefan Hoffmann

J. Autom. Lang. Comb., 2019

Computational Complexity of Synchronization under Regular Constraints.

Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Commutative Regular Languages - Properties and State Complexity.

Stefan Hoffmann

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2017

Shift-invariant topologies for the Cantor space X^ω.

Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger

Theor. Comput. Sci., 2017

2015

Subword Metrics for Infinite Words.

Stefan Hoffmann, Ludwig Staiger

Proceedings of the Implementation and Application of Automata, 2015