Stefan Hoffmann

Orcid: 0000-0002-7866-075X

Affiliations:
  • University of Trier, Germany


According to our database1, Stefan Hoffmann authored at least 35 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Automata Classes Accepting Languages Whose Commutative Closure is Regular.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages.
Int. J. Found. Comput. Sci., December, 2023

State Complexity Bounds for the Commutative Closure of Group Languages.
J. Autom. Lang. Comb., 2023

Completely Distinguishable Automata and the Set of Synchronizing Words.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Synchronization of Parikh Automata.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents.
Proceedings of the Implementation and Application of Automata, 2022

The Synchronization Game on Subclasses of Automata.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Reset Complexity and Completely Reachable Automata with Simple Idempotents.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
Constrained synchronization and commutativity.
Theor. Comput. Sci., 2021

Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents.
CoRR, 2021

Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited.
CoRR, 2021

State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints.
Proceedings of the Implementation and Application of Automata, 2021

The Commutative Closure of Shuffle Languages over Group Languages is Regular.
Proceedings of the Implementation and Application of Automata, 2021

The n-ary Initial Literal and Literal Shuffle.
Proceedings of the Prague Stringology Conference 2021, 2021

State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.
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.
Proceedings of the Language and Automata Theory and Applications, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
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.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters.
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.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

Commutative Regular Languages with Product-Form Minimal Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

Sync-Maximal Permutation Groups Equal Primitive Permutation Groups.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata.
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.
CoRR, 2020

State Complexity of Permutation on Finite Languages.
CoRR, 2020

Constraint Synchronization with Two or Three State Partial Constraint Automata.
CoRR, 2020

On A Class of Constrained Synchronization Problems in NP.
Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Computational Complexity of Synchronization Under Regular Commutative Constraints.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Extensions to Minimal Synchronizing Words.
J. Autom. Lang. Comb., 2019

Computational Complexity of Synchronization under Regular Constraints.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Commutative Regular Languages - Properties and State Complexity.
Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2017
Shift-invariant topologies for the Cantor space X<sup>ω</sup>.
Theor. Comput. Sci., 2017

2015
Subword Metrics for Infinite Words.
Proceedings of the Implementation and Application of Automata, 2015


  Loading...