Crossref
Completely Distinguishable Automata and the Set of Synchronizing Words
Theory of Computing Systems · 2026-06 · 70 (2)
DOI: 10.1007/s00224-024-10204-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theory of Computing Systems, online erschienen am 01.04.2026. Verfasst von Stefan Hoffmann. Die Arbeit nennt 40 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Hoffmann, S. (2026). Completely Distinguishable Automata and the Set of Synchronizing Words. Theory of Computing Systems, 70(2). https://doi.org/10.1007/s00224-024-10204-9
Vancouver
Hoffmann S. Completely Distinguishable Automata and the Set of Synchronizing Words. Theory of Computing Systems. 2026;70(2). doi:10.1007/s00224-024-10204-9
BibTeX
@article{Hoffmann2026,
author = {Hoffmann, Stefan},
title = {Completely Distinguishable Automata and the Set of Synchronizing Words},
journal = {Theory of Computing Systems},
year = {2026},
volume = {70},
number = {2},
doi = {10.1007/s00224-024-10204-9}
}
EUVIMED