A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)

MLA

Luis Alberto Croquevielle, et al. “A Polynomial-Time Approximation Algorithm for Counting Words Accepted by an NFA (Invited Paper).” Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, June 2021. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi...........92d392e6e06a120b9ac96bbfbcf275ba&authtype=sso&custid=ns315887.

APA

Luis Alberto Croquevielle, Rajesh Jayaram, Marcelo Arenas, & Cristian Riveros. (2021). A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper). Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing.

Chicago

Luis Alberto Croquevielle, Rajesh Jayaram, Marcelo Arenas, and Cristian Riveros. 2021. “A Polynomial-Time Approximation Algorithm for Counting Words Accepted by an NFA (Invited Paper).” Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, June. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi...........92d392e6e06a120b9ac96bbfbcf275ba&authtype=sso&custid=ns315887.