"Learning non-deterministic finite automata from queries and counterexamples."

Takashi Yokomori (1992)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2019-08-01

- no documents available
- export record
  dblp key:
  - conf/mi/Yokomori94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mi/Yokomori94
Takashi Yokomori:
Learning non-deterministic finite automata from queries and counterexamples. Machine Intelligence 13 1992: 169-189

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.