Stefan Hoffmann

59 papers B 3C 12Misc 4Journal 31Unranked 9
YearRankTypeTitle / Venue / Authors
2025 J jnl
The n-ary initial literal and literal shuffle.
Discret. Appl. Math.
Stefan Hoffmann
2025 J jnl
Uniform winning strategies for the synchronization games on subclasses of finite automata.
CoRR
Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail V. Volkov
2024 B conf
Automata Classes Accepting Languages Whose Commutative Closure is Regular.
SOFSEM
Stefan Hoffmann
2024 J jnl
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages.
Inf. Comput.
Stefan Hoffmann
2024 J jnl
Subset Mapping Problems in Solvable Automata.
J. Autom. Lang. Comb.
Stefan Hoffmann
2024 — conf
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata.
NCMA
Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov
2023 J jnl
Binary and circular automata having maximal state complexity for the set of synchronizing words.
Inf. Comput.
Stefan Hoffmann
2023 C conf
Completely Distinguishable Automata and the Set of Synchronizing Words.
DLT
Stefan Hoffmann
2023 J jnl
New characterizations of primitive permutation groups with applications to synchronizing automata.
Inf. Comput.
Stefan Hoffmann
2023 J jnl
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.
Int. J. Found. Comput. Sci.
Stefan Hoffmann
2023 J jnl
State Complexity Bounds for the Commutative Closure of Group Languages.
J. Autom. Lang. Comb.
Stefan Hoffmann
2023 J jnl
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.
Int. J. Found. Comput. Sci.
Stefan Hoffmann
2023 C conf
Synchronization of Parikh Automata.
DLT
Stefan Hoffmann
2022 C conf
Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages.
DLT
Stefan Hoffmann
2022 C conf
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents.
CIAA
Stefan Hoffmann
2022 — conf
Reset Complexity and Completely Reachable Automata with Simple Idempotents.
DCFS
Stefan Hoffmann
2022 Misc conf
The Synchronization Game on Subclasses of Automata.
FUN
Henning Fernau, Carolina Haase, Stefan Hoffmann
2021 — conf
Commutative Regular Languages with Product-Form Minimal Automata.
DCFS
Stefan Hoffmann
2021 J jnl
Commutative Regular Languages with Product-Form Minimal Automata.
CoRR
Stefan Hoffmann
2021 C conf
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.
LATA
Stefan Hoffmann
2021 B conf
Computational Complexity of Synchronization Under Sparse Regular Constraints.
FCT
Stefan Hoffmann
2021 J jnl
Computational Complexity of Synchronization under Sparse Regular Constraints.
CoRR
Stefan Hoffmann
2021 C conf
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.
DLT
Stefan Hoffmann
2021 J jnl
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.
CoRR
Stefan Hoffmann
2021 J jnl
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents.
CoRR
Stefan Hoffmann
2021 J jnl
Constrained synchronization and commutativity.
Theor. Comput. Sci.
Stefan Hoffmann
2021 J jnl
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.
CoRR
Henning Fernau, Stefan Hoffmann, Michael Wehar
2021 Misc conf
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata.
COCOON
Stefan Hoffmann
2021 — conf
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
FSTTCS
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
2021 J jnl
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
CoRR
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf
2021 C conf
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.
CIAA
Stefan Hoffmann
2021 J jnl
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.
CoRR
Stefan Hoffmann
2021 J jnl
State Complexity Investigations on Commutative Languages - The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages.
CoRR
Stefan Hoffmann
2021 — conf
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages.
DCFS
Stefan Hoffmann
2021 C conf
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints.
CIAA
Stefan Hoffmann
2021 C conf
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.
DLT
Stefan Hoffmann
2021 J jnl
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.
CoRR
Stefan Hoffmann
2021 C conf
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.
LATA
Stefan Hoffmann
2021 — conf
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups.
DCFS
Stefan Hoffmann
2021 J jnl
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups.
CoRR
Stefan Hoffmann
2021 C conf
The Commutative Closure of Shuffle Languages over Group Languages is Regular.
CIAA
Stefan Hoffmann
2021 Misc conf
The n-ary Initial Literal and Literal Shuffle.
PSC
Stefan Hoffmann
2021 J jnl
The n-ary Initial Literal and Literal Shuffle.
CoRR
Stefan Hoffmann
2020 J jnl
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words.
CoRR
Stefan Hoffmann
2020 Misc conf
Computational Complexity of Synchronization Under Regular Commutative Constraints.
COCOON
Stefan Hoffmann
2020 J jnl
Computational Complexity of Synchronization under Regular Commutative Constraints.
CoRR
Stefan Hoffmann
2020 J jnl
Constraint Synchronization with Two or Three State Partial Constraint Automata.
CoRR
Stefan Hoffmann
2020 — conf
On A Class of Constrained Synchronization Problems in NP.
ICTCS
Stefan Hoffmann
2020 J jnl
On a Class of Constrained Synchronization Problems in NP.
CoRR
Stefan Hoffmann
2020 J jnl
State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages.
CoRR
Stefan Hoffmann
2020 — conf
State Complexity Bounds for the Commutative Closure of Group Languages.
DCFS
Stefan Hoffmann
2020 J jnl
State Complexity Bounds for the Commutative Closure of Group Languages.
CoRR
Stefan Hoffmann
2020 J jnl
State Complexity of Permutation on Finite Languages.
CoRR
Stefan Hoffmann
2020 J jnl
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.
CoRR
Stefan Hoffmann
2019 — conf
Commutative Regular Languages - Properties and State Complexity.
CAI
Stefan Hoffmann
2019 B conf
Computational Complexity of Synchronization under Regular Constraints.
MFCS
Henning Fernau, Vladimir V. Gusev, Stefan Hoffmann, Markus Holzer, Mikhail V. Volkov, Petra Wolf
2019 J jnl
Extensions to Minimal Synchronizing Words.
J. Autom. Lang. Comb.
Henning Fernau, Stefan Hoffmann
2017 J jnl
Shift-invariant topologies for the Cantor space X
Theor. Comput. Sci.
Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger
2015 C conf
Subword Metrics for Infinite Words.
CIAA
Stefan Hoffmann, Ludwig Staiger