A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper) (Q6086980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper) |
scientific article; zbMATH DE number 7765139
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper) |
scientific article; zbMATH DE number 7765139 |
Statements
A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper) (English)
0 references
14 November 2023
0 references
non-deterministic finite automata
0 references
approximate counting
0 references
regular languages
0 references
uniform generation
0 references
