"State Complexity Investigations on Commutative Languages - the Upward and ..."

Stefan Hoffmann (2021)

> Home

Details and statistics

DOI: 10.1007/978-3-030-93489-7_6

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcfs/Hoffmann21b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/Hoffmann21b
Stefan Hoffmann:
State Complexity Investigations on Commutative Languages - the Upward and Downward Closure, Commutative Aperiodic and Commutative Group Languages. DCFS 2021: 64-75

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.