default search action
Stefan Hoffmann 0001
Person information
- affiliation: University of Trier, Germany
Other persons with the same name
- Stefan Hoffmann — disambiguation page
- Stefan Hoffmann 0002 — Heinrich-Heine-Universität Düsseldorf, Germany
- Stefan Hoffmann 0003 — Cologne University of Applied Sciences, Germany
- Stefan Hoffmann 0004 (aka: Stefan G. Hoffmann) — Hochschule Ruhr West, Institute of Computer Science, Bottrop, Germany
- Stefan Hoffmann 0005 — Oregon Health Science University, Portland, OR, USA
- Stefan Hoffmann 0006
— Christian-Albrechts-Universität zu Kiel, Germany
- Stefan Hoffmann 0007 — Friedrich Schiller University Jena, Germany
- Stefan Hoffmann 0008 (aka: Stefan H. Hoffmann) — mediri GmbH, Heidelberg, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c28]Stefan Hoffmann
Automata Classes Accepting Languages Whose Commutative Closure is Regular. SOFSEM 2024: 311-325 - [c27]Henning Fernau, Carolina Haase, Stefan Hoffmann, Mikhail Volkov:
Winning Strategies for the Synchronization Game on Subclasses of Finite Automata. NCMA 2024: 77-85 - 2023
- [j7]Stefan Hoffmann
Binary and circular automata having maximal state complexity for the set of synchronizing words. Inf. Comput. 295(Part B): 105076 (2023) - [j6]Stefan Hoffmann
New characterizations of primitive permutation groups with applications to synchronizing automata. Inf. Comput. 295(Part B): 105086 (2023) - [j5]Stefan Hoffmann
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. Int. J. Found. Comput. Sci. 34(8): 923-957 (2023) - [j4]Stefan Hoffmann
State Complexity Bounds for the Commutative Closure of Group Languages. J. Autom. Lang. Comb. 28(1-3): 27-57 (2023) - [c26]Stefan Hoffmann
Synchronization of Parikh Automata. DLT 2023: 113-127 - [c25]Stefan Hoffmann
Completely Distinguishable Automata and the Set of Synchronizing Words. DLT 2023: 128-142 - 2022
- [c24]Stefan Hoffmann
Reset Complexity and Completely Reachable Automata with Simple Idempotents. DCFS 2022: 85-99 - [c23]Stefan Hoffmann
Automata-Theoretical Regularity Characterizations for the Iterated Shuffle on Commutative Regular Languages. DLT 2022: 164-176 - [c22]Henning Fernau
The Synchronization Game on Subclasses of Automata. FUN 2022: 14:1-14:17 - [c21]Stefan Hoffmann
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents. CIAA 2022: 225-237 - 2021
- [j3]Stefan Hoffmann
Constrained synchronization and commutativity. Theor. Comput. Sci. 890: 147-170 (2021) - [c20]Stefan Hoffmann
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata. COCOON 2021: 176-188 - [c19]Stefan Hoffmann
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. DCFS 2021: 38-50 - [c18]Stefan Hoffmann
Commutative Regular Languages with Product-Form Minimal Automata. DCFS 2021: 51-63 - [c17]Stefan Hoffmann
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. DCFS 2021: 64-75 - [c16]Stefan Hoffmann
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. DLT 2021: 192-203 - [c15]Stefan Hoffmann
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. DLT 2021: 204-216 - [c14]Stefan Hoffmann
Computational Complexity of Synchronization Under Sparse Regular Constraints. FCT 2021: 272-286 - [c13]Emmanuel Arrighi, Henning Fernau
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS 2021: 34:1-34:15 - [c12]Stefan Hoffmann
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA 2021: 305-317 - [c11]Stefan Hoffmann
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. LATA 2021: 318-330 - [c10]Stefan Hoffmann:
The n-ary Initial Literal and Literal Shuffle. Stringology 2021: 61-74 - [c9]Stefan Hoffmann
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. CIAA 2021: 27-38 - [c8]Stefan Hoffmann
The Commutative Closure of Shuffle Languages over Group Languages is Regular. CIAA 2021: 53-64 - [c7]Stefan Hoffmann
State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints. CIAA 2021: 115-126 - [i19]Stefan Hoffmann:
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. CoRR abs/2103.09587 (2021) - [i18]Stefan Hoffmann:
Computational Complexity of Synchronization under Sparse Regular Constraints. CoRR abs/2108.00081 (2021) - [i17]Henning Fernau, Stefan Hoffmann, Michael Wehar:
Finite Automata Intersection Non-Emptiness: Parameterized Complexity Revisited. CoRR abs/2108.05244 (2021) - [i16]Stefan Hoffmann:
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. CoRR abs/2108.06976 (2021) - [i15]Stefan Hoffmann:
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. CoRR abs/2108.06984 (2021) - [i14]Stefan Hoffmann:
The n-ary Initial Literal and Literal Shuffle. CoRR abs/2108.09282 (2021) - [i13]Stefan Hoffmann:
Constrained Synchronization for Commutative Automata and Automata with Simple Idempotents. CoRR abs/2109.02743 (2021) - [i12]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 abs/2110.01279 (2021) - [i11]Stefan Hoffmann:
Commutative Regular Languages with Product-Form Minimal Automata. CoRR abs/2111.13523 (2021) - [i10]Stefan Hoffmann:
State Complexity Investigations on Commutative Languages - The Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. CoRR abs/2111.13524 (2021) - [i9]Stefan Hoffmann:
Sync-Maximal Permutation Groups Equal Primitive Permutation Groups. CoRR abs/2111.13527 (2021) - 2020
- [c6]Stefan Hoffmann
Computational Complexity of Synchronization Under Regular Commutative Constraints. COCOON 2020: 460-471 - [c5]Stefan Hoffmann
State Complexity Bounds for the Commutative Closure of Group Languages. DCFS 2020: 64-77 - [c4]Stefan Hoffmann:
On A Class of Constrained Synchronization Problems in NP. ICTCS 2020: 145-157 - [i8]Stefan Hoffmann:
State Complexity Bounds for the Commutative Closure of Group Languages. CoRR abs/2004.11772 (2020) - [i7]Stefan Hoffmann:
Computational Complexity of Synchronization under Regular Commutative Constraints. CoRR abs/2005.04042 (2020) - [i6]Stefan Hoffmann:
Constraint Synchronization with Two or Three State Partial Constraint Automata. CoRR abs/2005.05907 (2020) - [i5]Stefan Hoffmann:
On a Class of Constrained Synchronization Problems in NP. CoRR abs/2006.01903 (2020) - [i4]Stefan Hoffmann:
State Complexity of Permutation on Finite Languages. CoRR abs/2006.15178 (2020) - [i3]Stefan Hoffmann:
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. CoRR abs/2007.09104 (2020) - [i2]Stefan Hoffmann:
State Complexity Bounds for Shuffle and Iterated Shuffle Combined with the Commutative Closure on Group Languages. CoRR abs/2008.05420 (2020) - [i1]Stefan Hoffmann:
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. CoRR abs/2011.14404 (2020)
2010 – 2019
- 2019
- [j2]Henning Fernau, Stefan Hoffmann
Extensions to Minimal Synchronizing Words. J. Autom. Lang. Comb. 24(2-4): 287-307 (2019) - [c3]Stefan Hoffmann
Commutative Regular Languages - Properties and State Complexity. CAI 2019: 151-163 - [c2]Henning Fernau
Computational Complexity of Synchronization under Regular Constraints. MFCS 2019: 63:1-63:14 - 2017
- [j1]Stefan Hoffmann
Shift-invariant topologies for the Cantor space Xω. Theor. Comput. Sci. 679: 145-161 (2017) - 2015
- [c1]Stefan Hoffmann
Subword Metrics for Infinite Words. CIAA 2015: 165-175
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: