"State Complexity of Partial Word Finite Automata."

Martin Kutrib, Matthias Wendlandt (2021)

> Home

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dcfs/KutribW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/KutribW21
Martin Kutrib, Matthias Wendlandt:
State Complexity of Partial Word Finite Automata. DCFS 2021: 113-124

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.