On completely reachable automata and subset reachability (Q1622980)
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 6983389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On completely reachable automata and subset reachability |
scientific article; zbMATH DE number 6983389 |
Statements
On completely reachable automata and subset reachability (English)
0 references
22 November 2018
0 references
0.8983113169670105
0 references
0.8973482251167297
0 references
0.7721656560897827
0 references
0.7708648443222046
0 references
0.7658236026763916
0 references
