How to translate efficiently extensions of temporal logics into alternating automata (Q2915098)
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: How to translate efficiently extensions of temporal logics into alternating automata |
scientific article; zbMATH DE number 6084971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to translate efficiently extensions of temporal logics into alternating automata |
scientific article; zbMATH DE number 6084971 |
Statements
How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata (English)
0 references
21 September 2012
0 references
0.8020291924476624
0 references
0.797976553440094
0 references
0.7962663769721985
0 references
0.7926425933837891
0 references
