"Completely Reachable Automata, Primitive Groups and the State Complexity ..."

Stefan Hoffmann (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-68195-1_24

access: closed

type: Conference or Workshop Paper

metadata version: 2021-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/Hoffmann21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/Hoffmann21
Stefan Hoffmann:
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA 2021: 305-317

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.