"One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the ..."

Sicco Verwer, Mathijs de Weerdt, Cees Witteveen (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-00982-2_63

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/VerwerWW09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/VerwerWW09
Sicco Verwer, Mathijs de Weerdt, Cees Witteveen:
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit. LATA 2009: 740-751

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.