Polynomial-time algorithm for fixed points of nontrivial morphisms (Q1044983): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Finding a homomorphism between two words is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed languages and the adult languages of ol schemest<sup>†</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3711767 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Morphically primitive words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two-sided infinite fixed points of morphisms / rank | |||
Normal rank |
Latest revision as of 06:51, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial-time algorithm for fixed points of nontrivial morphisms |
scientific article |
Statements
Polynomial-time algorithm for fixed points of nontrivial morphisms (English)
0 references
15 December 2009
0 references
fixed point
0 references
morphical primitivity
0 references
polynomial algorithm
0 references