A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.06.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999507562 / rank | |||
Normal rank | |||
Revision as of 15:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on emptiness for alternating finite automata with a one-letter alphabet |
scientific article |
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
