%0 Conference Paper %1 conf/mfcs/MadhusudanV09 %A Madhusudan, P. %A Viswanathan, Mahesh %B MFCS %D 2009 %E Královic, Rastislav %E Niwinski, Damian %I Springer %K dblp %P 561-573 %T Query Automata for Nested Words. %U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2009.html#MadhusudanV09 %V 5734 %@ 978-3-642-03815-0

@inproceedings{conf/mfcs/MadhusudanV09, added-at = {2017-05-25T00:00:00.000+0200}, author = {Madhusudan, P. and Viswanathan, Mahesh}, biburl = {https://www.bibsonomy.org/bibtex/2ea64e0806ef2c66a7bdabb0fcc428b19/dblp}, booktitle = {MFCS}, crossref = {conf/mfcs/2009}, editor = {Královic, Rastislav and Niwinski, Damian}, ee = {https://doi.org/10.1007/978-3-642-03816-7_48}, interhash = {1d6962820965ab2f40ea27f3bdf68161}, intrahash = {ea64e0806ef2c66a7bdabb0fcc428b19}, isbn = {978-3-642-03815-0}, keywords = {dblp}, pages = {561-573}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:10:55.000+0200}, title = {Query Automata for Nested Words.}, url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2009.html#MadhusudanV09}, volume = 5734, year = 2009 }