"Binary and circular automata having maximal state complexity for the set ..."

Stefan Hoffmann (2023)

> Home

Details and statistics

DOI: 10.1016/J.IC.2023.105076

access: closed

type: Journal Article

metadata version: 2025-04-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/Hoffmann23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Hoffmann23
Stefan Hoffmann:
Binary and circular automata having maximal state complexity for the set of synchronizing words. Inf. Comput. 295(Part A): 105076 (2023)

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.