( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Boykottpartizipation

. Gabler Edition Wissenschaft Gabler, Wiesbaden, 1. Aufl. издание, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

Stefan Hoffmann

 

Другие публикации лиц с тем же именем

Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes., , , , , и . OR, стр. 331-338. Springer, (2019)Completely Distinguishable Automata and the Set of Synchronizing Words.. DLT, том 13911 из Lecture Notes in Computer Science, стр. 128-142. Springer, (2023)State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.. LATA, том 12638 из Lecture Notes in Computer Science, стр. 318-330. Springer, (2021)Commutative Regular Languages with Product-Form Minimal Automata.. DCFS, том 13037 из Lecture Notes in Computer Science, стр. 51-63. Springer, (2021)Reset Complexity and Completely Reachable Automata with Simple Idempotents.. DCFS, том 13439 из Lecture Notes in Computer Science, стр. 85-99. Springer, (2022)New characterizations of primitive permutation groups with applications to synchronizing automata.. Inf. Comput., 295 (Part B): 105086 (декабря 2023)Powerless Security., , , и . ACNS (2), том 12147 из Lecture Notes in Computer Science, стр. 213-232. Springer, (2020)Boykottpartizipation. Gabler Edition Wissenschaft Gabler, Wiesbaden, 1. Aufl. издание, (2008)Computational Complexity of Synchronization Under Regular Commutative Constraints.. COCOON, том 12273 из Lecture Notes in Computer Science, стр. 460-471. Springer, (2020)State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets.. CoRR, (2020)