%0 Conference Paper %1 conf/stacs/GoldwurmPS01 %A Goldwurm, Massimiliano %A Palano, Beatrice %A Santini, Massimo %B STACS %D 2001 %E Ferreira, Afonso %E Reichel, Horst %I Springer %K dblp %P 305-316 %T On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#GoldwurmPS01 %V 2010 %@ 3-540-41695-1

@inproceedings{conf/stacs/GoldwurmPS01, added-at = {2018-01-02T00:00:00.000+0100}, author = {Goldwurm, Massimiliano and Palano, Beatrice and Santini, Massimo}, biburl = {https://www.bibsonomy.org/bibtex/279bcef15f0370ec12767b3ac0021b7c2/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2001}, editor = {Ferreira, Afonso and Reichel, Horst}, ee = {https://doi.org/10.1007/3-540-44693-1_27}, interhash = {cd58d3e2a2c2af81ac01b58a3f841d4d}, intrahash = {79bcef15f0370ec12767b3ac0021b7c2}, isbn = {3-540-41695-1}, keywords = {dblp}, pages = {305-316}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T15:25:03.000+0200}, title = {On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2001.html#GoldwurmPS01}, volume = 2010, year = 2001 }