A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016)
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 5686449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on emptiness for alternating finite automata with a one-letter alphabet |
scientific article; zbMATH DE number 5686449 |
Statements
A note on emptiness for alternating finite automata with a one-letter alphabet (English)
0 references
24 March 2010
0 references
computational complexity
0 references
alternating finite automaton
0 references
emptiness
0 references
0.8512358069419861
0 references
0.7731377482414246
0 references
0.7626452445983887
0 references
