Periodic character sequences where identifying two characters strictly reduces the period

DOI10.1016/0304-3975(85)90219-1zbMath0575.68057OpenAlexW1988127220MaRDI QIDQ1064070

Masatosi Imori, Hisao Yamada

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90219-1

zbMATH Keywords

periodic sequencesalphabet size reductiondegenerate cellular automataprimitive period

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Cites Work

• One Step Transformation of Periodic Sequences by Cellular Automata
• Unnamed Item
• Unnamed Item

This page was built for publication: Periodic character sequences where identifying two characters strictly reduces the period