"Learning Deterministic Finite Automata from Infinite Alphabets."

Gaetano Pellegrino et al. (2016)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2019-05-29

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icgi/PellegrinoHLV16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icgi/PellegrinoHLV16
Gaetano Pellegrino, Christian A. Hammerschmidt, Qin Lin, Sicco Verwer:
Learning Deterministic Finite Automata from Infinite Alphabets. ICGI 2016: 120-131

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.