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

DOI10.1145/3406325.3465353OpenAlexW3167021912MaRDI QIDQ6086980

Luis Alberto Croquevielle, Marcelo Arenas, Cristian Riveros, Rajesh Jayaram

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3465353

zbMATH Keywords

regular languagesapproximate countingnon-deterministic finite automatauniform generation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper)