"Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples."

Rajesh Parekh, Vasant G. Honavar (1999)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2017-11-13

- no documents available
- export record
  dblp key:
  - conf/icml/ParekhH99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/ParekhH99
Rajesh Parekh, Vasant G. Honavar:
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples. ICML 1999: 298-306

a service of

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.