"On the complexity of intersecting finite state automata and N L versus N P."

George Karakostas, Richard J. Lipton, Anastasios Viglas (2003)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(02)00830-7

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/KarakostasLV03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KarakostasLV03
George Karakostas, Richard J. Lipton, Anastasios Viglas:
On the complexity of intersecting finite state automata and N L versus N P. Theor. Comput. Sci. 302(1-3): 257-274 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.