TY - GEN
T1 - A note on the computational complexity of some problems for self-verifying finite automata
A1 - Holzer,Markus
A1 - Jakobi,Sebastian
Y1 - 2017/04/12
N2 - We consider the computational complexity of some problems for self-verifying finite automata (svFAs). In particular, we answer a question stated in the open problem session of the Workshop on Descriptional Complexity of Formal Systems 2015 held in Waterloo, Ontario, Canada, on the complexity of the promise version of the general membership problem for svFAs, showing that this problem is NL-complete.
CY - Gießen
PB - Universitätsbibliothek
AD - Otto-Behaghel-Str. 8, 35394 Gießen
UR - http://geb.uni-giessen.de/geb/volltexte/2017/12610
ER -