Stefan Hoffmann. Completely Distinguishable Automata and the Set of Synchronizing Words. // Theory of Computing Systems. – 2026. – DOI: 10.1007/s00224-024-10204-9. – URL: https://doi.org/10.1007/s00224-024-10204-9
Stefan Hoffmann (2026). Completely Distinguishable Automata and the Set of Synchronizing Words. Theory of Computing Systems. https://doi.org/10.1007/s00224-024-10204-9
Stefan Hoffmann. “Completely Distinguishable Automata and the Set of Synchronizing Words.” Theory of Computing Systems, 2026. doi:10.1007/s00224-024-10204-9.
@article{Hoffmann2026,
title = {Completely Distinguishable Automata and the Set of Synchronizing Words},
author = {Hoffmann, Stefan},
journal = {Theory of Computing Systems},
year = {2026},
doi = {10.1007/s00224-024-10204-9},
url = {https://doi.org/10.1007/s00224-024-10204-9}
}