When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata) (Q3557075)
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: When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata) |
scientific article; zbMATH DE number 5702239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata) |
scientific article; zbMATH DE number 5702239 |
Statements
When Simulation Meets Antichains (English)
0 references
27 April 2010
0 references
0.8640098571777344
0 references
0.8398482203483582
0 references
0.82890784740448
0 references
0.8098627328872681
0 references
