View in EDS

On the complexity of intersecting finite state automata and NL versus NP

Saved in:

Bibliographic Details
Title:	On the complexity of intersecting finite state automata and NL versus NP
Authors:	Karakostas, George¹ karakos@mcmaster.ca, Lipton, Richard J.^2,3 rjl@cc.gatech.edu, Viglas, Anastasios⁴ aviglas@cs.toronto.edu
Source:	Theoretical Computer Science. Jun2003, Vol. 302 Issue 1-3, p257. 18p.
Subjects:	Algorithms, Machine theory
Abstract:	We consider uniform and non-uniform assumptions for the hardness of an explicit problem from finite state automata theory. First we show that a small improvement in the known straightforward algorithm for this problem can be used to design faster algorithms for subset sum and factoring, and improved deterministic simulations for non-deterministic time.On the other hand, we can use the same improved algorithm for our FSA problem to prove complexity class separation results (NL is not equal to P, or NP for the non-uniform case). This result can be viewed either as a hardness result for the FSA intersection problem, or as a method for separating NL from P or NP. It is interesting to note that this approach is based on a more general method for separating two complexity classes, using algorithms rather than lower bounds. [Copyright &y& Elsevier]
	Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Be the first to leave a comment!