"Learning Deterministic Finite Automata from Smallest Counterexamples."

Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon (1998)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2016-07-13

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/BirkendorfBS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BirkendorfBS98
Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon:
Learning Deterministic Finite Automata from Smallest Counterexamples. SODA 1998: 599-608

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.