"Inference of Over-Constrained NFA of Size k+1 to Efficiently and ..."

Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-35995-8_10

access: closed

type: Conference or Workshop Paper

metadata version: 2023-07-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iccS/JastrzabLM23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccS/JastrzabLM23
Tomasz Jastrzab, Frédéric Lardeux, Éric Monfroy:
Inference of Over-Constrained NFA of Size k+1 to Efficiently and Systematically Derive NFA of Size k for Grammar Learning. ICCS (1) 2023: 134-147

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.