On the complexity of computing the profinite closure of a rational language (Q719326): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q442145 |
||
| Property / author | |||
| Property / author: Pierre-Cyrille Héam / rank | |||
Revision as of 20:24, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing the profinite closure of a rational language |
scientific article |
Statements
On the complexity of computing the profinite closure of a rational language (English)
0 references
10 October 2011
0 references
finite automata
0 references
state complexity
0 references
profinite topology
0 references
