Stefan Hoffmann

Available identifiers

zbMath Open hoffmann.stefanMaRDI QIDQ278721

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6187048	2024-02-05	Paper
Binary and circular automata having maximal state complexity for the set of synchronizing words	2024-02-02	Paper
New characterizations of primitive permutation groups with applications to synchronizing automata	2024-02-02	Paper
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages	2023-11-24	Paper
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs	2023-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q6070603	2023-11-23	Paper
Synchronization of Parikh automata	2023-11-16	Paper
Completely distinguishable automata and the set of synchronizing words	2023-11-16	Paper
Ideal separation and general theorems for constrained synchronization and their application to small constraint automata	2023-03-30	Paper
Reset complexity and completely reachable automata with simple idempotents	2023-01-18	Paper
Sync-maximal permutation groups equal primitive permutation groups	2022-11-09	Paper
Commutative regular languages with product-form minimal automata	2022-11-09	Paper
State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages	2022-11-09	Paper
Constrained synchronization for monotonic and solvable automata and automata with simple idempotents	2022-08-16	Paper
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages	2022-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q5092426	2022-07-21	Paper
Computational complexity of synchronization under sparse regular constraints	2022-05-20	Paper
State complexity of projection on languages recognized by permutation automata and commuting letters	2022-03-25	Paper
Constrained synchronization and subset synchronization problems for weakly acyclic automata	2022-03-25	Paper
Regularity conditions for iterated shuffle on commutative regular languages	2022-03-22	Paper
The commutative closure of shuffle languages over group languages is regular	2022-03-22	Paper
State complexity of permutation and related decision problems on alphabetical pattern constraints	2022-03-22	Paper
Constrained synchronization and commutativity	2021-10-21	Paper
Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words	2021-10-04	Paper
State complexity of the set of synchronizing words for circular automata and automata over binary alphabets	2021-10-04	Paper
Exact solutions for the Steiner path cover problem on special graph classes	2021-08-30	Paper
State complexity bounds for the commutative closure of group languages	2021-07-14	Paper
Computational complexity of synchronization under regular commutative constraints	2021-04-21	Paper
Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)	2020-07-20	Paper
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words	2020-07-17	Paper
Commutative regular languages -- properties and state complexity	2020-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q5208373	2020-01-15	Paper
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components	2019-10-15	Paper
Computing the metric dimension by decomposing graphs into extended biconnected components	2018-06-27	Paper
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements	2018-05-25	Paper
Shift-invariant topologies for the Cantor space \(X^{\omega}\)	2017-06-19	Paper
A linear time algorithm for metric dimension of cactus block graphs	2016-05-02	Paper
Subword Metrics for Infinite Words	2015-09-23	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stefan Hoffmann