A note on emptiness for alternating finite automata with a one-letter alphabet
Loading...
Downloads
0
Date issued
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Location
Není ve fondu ÚK
Signature
Abstract
Description
Subject(s)
computational complexity, alternating finite automaton, emptiness
Citation
Information Processing Letters. 2007, vol. 104, issue 5, p. 164-167.