Repetitiveness of D0L-languages is decidable in polynomial time (Q4699310)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1361492
Language Label Description Also known as
default for all languages
No label defined
    English
    Repetitiveness of D0L-languages is decidable in polynomial time
    scientific article; zbMATH DE number 1361492

      Statements

      0 references
      0 references
      17 October 2000
      0 references
      subwords
      0 references
      languages generated by morphisms
      0 references
      Repetitiveness of D0L-languages is decidable in polynomial time (English)
      0 references

      Identifiers