Stefan Hoffmann

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 52

Top Topics

Regular Languages

Decision Problems

Computational Complexity

Finite Automata

Top Venues

Publications

Stefan Hoffmann
Automata Classes Accepting Languages Whose Commutative Closure is Regular. SOFSEM (2024)
Stefan Hoffmann
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. Int. J. Found. Comput. Sci. 34 (8) (2023)
Stefan Hoffmann
Synchronization of Parikh Automata. DLT (2023)
Stefan Hoffmann
Binary and circular automata having maximal state complexity for the set of synchronizing words. Inf. Comput. 295 (Part B) (2023)
Stefan Hoffmann
New characterizations of primitive permutation groups with applications to synchronizing automata. Inf. Comput. 295 (Part B) (2023)
Stefan Hoffmann
State Complexity Bounds for the Commutative Closure of Group Languages. J. Autom. Lang. Comb. 28 (1-3) (2023)
Stefan Hoffmann
Completely Distinguishable Automata and the Set of Synchronizing Words. DLT (2023)
Stefan Hoffmann
Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages. DLT (2022)
Henning Fernau, Carolina Haase, Stefan Hoffmann
The Synchronization Game on Subclasses of Automata. FUN (2022)
Stefan Hoffmann
Reset Complexity and Completely Reachable Automata with Simple Idempotents. DCFS (2022)
Stefan Hoffmann
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents. CIAA (2022)
Stefan Hoffmann
Computational Complexity of Synchronization under Sparse Regular Constraints. CoRR (2021)
Stefan Hoffmann
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. DCFS (2021)
Stefan Hoffmann
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. CoRR (2021)
Henning Fernau, Stefan Hoffmann, Michael Wehar
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR (2021)
Stefan Hoffmann
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. LATA (2021)
Stefan Hoffmann
The n-ary Initial Literal and Literal Shuffle. CoRR (2021)
Stefan Hoffmann
The n-ary Initial Literal and Literal Shuffle. Stringology (2021)
Stefan Hoffmann
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata. COCOON (2021)
Stefan Hoffmann
The Commutative Closure of Shuffle Languages over Group Languages is Regular. CIAA (2021)
Stefan Hoffmann
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. CoRR (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS (2021)
Stefan Hoffmann
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. CoRR (2021)
Stefan Hoffmann
Commutative Regular Languages with Product-Form Minimal Automata. DCFS (2021)
Stefan Hoffmann
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. DCFS (2021)
Stefan Hoffmann
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. CoRR (2021)
Stefan Hoffmann
State Complexity Investigations on Commutative Languages - The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. CoRR (2021)
Stefan Hoffmann
Commutative Regular Languages with Product-Form Minimal Automata. CoRR (2021)
Stefan Hoffmann
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. DLT (2021)
Stefan Hoffmann
Computational Complexity of Synchronization Under Sparse Regular Constraints. FCT (2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR (2021)
Stefan Hoffmann
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints. CIAA (2021)
Stefan Hoffmann
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents. CoRR (2021)
Stefan Hoffmann
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. DLT (2021)
Stefan Hoffmann
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. CIAA (2021)
Stefan Hoffmann
Constrained synchronization and commutativity. Theor. Comput. Sci. 890 (2021)
Stefan Hoffmann
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA (2021)
Stefan Hoffmann
Constraint Synchronization with Two or Three State Partial Constraint Automata. CoRR (2020)
Stefan Hoffmann
State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages. CoRR (2020)
Stefan Hoffmann
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. CoRR (2020)
Stefan Hoffmann
On A Class of Constrained Synchronization Problems in NP. ICTCS (2020)
Stefan Hoffmann
State Complexity of Permutation on Finite Languages. CoRR (2020)
Stefan Hoffmann
State Complexity Bounds for the Commutative Closure of Group Languages. DCFS (2020)
Stefan Hoffmann
State Complexity Bounds for the Commutative Closure of Group Languages. CoRR (2020)
Stefan Hoffmann
Computational Complexity of Synchronization under Regular Commutative Constraints. CoRR (2020)
Stefan Hoffmann
Computational Complexity of Synchronization Under Regular Commutative Constraints. COCOON (2020)
Stefan Hoffmann
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. CoRR (2020)
Stefan Hoffmann
On a Class of Constrained Synchronization Problems in NP. CoRR (2020)
Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf
Computational Complexity of Synchronization under Regular Constraints. MFCS (2019)
Henning Fernau, Stefan Hoffmann
Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. 24 (2-4) (2019)
Stefan Hoffmann
Commutative Regular Languages - Properties and State Complexity. CAI (2019)
Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger
. Theor. Comput. Sci. 679 (2017)
Stefan Hoffmann, Ludwig Staiger
Subword Metrics for Infinite Words. CIAA (2015)