On the complexity of computing the profinite closure of a rational language (Q719326): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032947973 / rank | |||
Normal rank | |||
Revision as of 02:57, 20 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
