One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (Q3618628)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5538891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit |
scientific article; zbMATH DE number 5538891 |
Statements
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (English)
0 references
2 April 2009
0 references
0.89908046
0 references
0.88334835
0 references
0 references
0.86823565
0 references
0.86158496
0 references
0.8570973
0 references
0 references
0.85097575
0 references
0.8480163
0 references
