Profinite Methods in Automata Theory¶
Pin, J. (2009). Profinite Methods in Automata Theory. 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), 31-50.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Profinite Word
- Distinct finite words remain distinct, and the completion is a compact topological monoid containing A* densely.
This sourcePrimary author survey for the finite-alphabet completion, finite-quotient semantics, `x^ω`, `ρ_A`, equation uses, and pro-V boundary; Pin credits earlier work for the convergence of `ρ_A`.
- Distinct finite words remain distinct, and the completion is a compact topological monoid containing A* densely.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:7f39539858dd · see in the full table