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, George1, karakos@mcmaster.ca, Lipton, Richard J.2,3, rjl@cc.gatech.edu, Viglas, Anastasios4, aviglas@cs.toronto.edu
Source: Theoretical Computer Science; Jun2003, Vol. 302 Issue 1-3, p257, 18p
Database: Applied Science & Technology Source
Be the first to leave a comment!
You must be logged in first