"Learning Deterministic Finite Automata from Smallest Counterexamples."

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

> Home

Details and statistics

DOI: 10.1137/S0895480198340943

access: closed

type: Journal Article

metadata version: 2023-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/BirkendorfBS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BirkendorfBS00
Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon:
Learning Deterministic Finite Automata from Smallest Counterexamples. SIAM J. Discret. Math. 13(4): 465-491 (2000)

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.