On the complexity of computing the profinite closure of a rational language (Q719326): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:04, 5 March 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
