Classes of timed automata and the undecidability of universality (Q5450118)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classes of timed automata and the undecidability of universality |
scientific article; zbMATH DE number 5251109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of timed automata and the undecidability of universality |
scientific article; zbMATH DE number 5251109 |
Statements
19 March 2008
0 references
timed automata: universality
0 references
analytic hierarchy
0 references
0.8952271342277527
0 references
0.8254501223564148
0 references
0.8064473867416382
0 references
0.8054568767547607
0 references
