One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (Q3618628)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit |
scientific article |
Statements
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (English)
0 references
2 April 2009
0 references
