Hardness Results for Intersection NonEmptiness Michael
edu January 16 2015 Abstract We carefully reexamine a construction of Karakostas Lipton and Vi glas 2003 to show that the intersection nonemptiness problem for DFAs deterministic 64257nite automata characterizes the complexity class NL In particular
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Hardness Results for Intersection NonEmp..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.