%0 Journal Article %1 journals/tcs/KarakostasLV03 %A Karakostas, George %A Lipton, Richard J. %A Viglas, Anastasios %D 2003 %J Theor. Comput. Sci. %K dblp %N 1-3 %P 257-274 %T On the complexity of intersecting finite state automata and N L versus N P. %U http://dblp.uni-trier.de/db/journals/tcs/tcs302.html#KarakostasLV03 %V 302

@article{journals/tcs/KarakostasLV03, added-at = {2021-02-17T00:00:00.000+0100}, author = {Karakostas, George and Lipton, Richard J. and Viglas, Anastasios}, biburl = {https://www.bibsonomy.org/bibtex/279819129a557eb6e4f5f8a3512a66128/dblp}, ee = {https://doi.org/10.1016/S0304-3975(02)00830-7}, interhash = {3d3d7fbd6ae650e4546e739871e32f2d}, intrahash = {79819129a557eb6e4f5f8a3512a66128}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, number = {1-3}, pages = {257-274}, timestamp = {2024-04-08T18:39:34.000+0200}, title = {On the complexity of intersecting finite state automata and N L versus N P.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs302.html#KarakostasLV03}, volume = 302, year = 2003 }