On the complexity of computing the profinite closure of a rational language (Q719326)
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: On the complexity of computing the profinite closure of a rational language |
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
