"Completely Distinguishable Automata and the Set of Synchronizing Words."

Stefan Hoffmann (2026)

> Home

Details and statistics

DOI: 10.1007/S00224-024-10204-9

access: closed

type: Journal Article

metadata version: 2026-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Hoffmann26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Hoffmann26
Stefan Hoffmann:
Completely Distinguishable Automata and the Set of Synchronizing Words. Theory Comput. Syst. 70(2): 20 (2026)

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.