%0 Conference Paper %1 conf/dcfs/0001RS17 %A Ng, Timothy %A Rappaport, David %A Salomaa, Kai %B DCFS %D 2017 %E Pighizzini, Giovanni %E Câmpeanu, Cezar %I Springer %K dblp %P 287-298 %T State Complexity of Suffix Distance. %U http://dblp.uni-trier.de/db/conf/dcfs/dcfs2017.html#0001RS17 %V 10316 %@ 978-3-319-60252-3

@inproceedings{conf/dcfs/0001RS17, added-at = {2017-06-22T00:00:00.000+0200}, author = {Ng, Timothy and Rappaport, David and Salomaa, Kai}, biburl = {https://www.bibsonomy.org/bibtex/2997ca70890e48b3b09d0536fc4bacca3/dblp}, booktitle = {DCFS}, crossref = {conf/dcfs/2017}, editor = {Pighizzini, Giovanni and Câmpeanu, Cezar}, ee = {https://doi.org/10.1007/978-3-319-60252-3_23}, interhash = {b2045d35333b34376267cdb2698c1e63}, intrahash = {997ca70890e48b3b09d0536fc4bacca3}, isbn = {978-3-319-60252-3}, keywords = {dblp}, pages = {287-298}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:58:59.000+0200}, title = {State Complexity of Suffix Distance.}, url = {http://dblp.uni-trier.de/db/conf/dcfs/dcfs2017.html#0001RS17}, volume = 10316, year = 2017 }