m-recognizability of sets closed under certain affine functions

DOI10.1016/0166-218X(88)90067-4zbMath0682.68084MaRDI QIDQ1824406

David A. Klarner

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite automatonaffine functionsm-ary stringsm-recognizable set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Some fascinating integer sequences ⋮ Unnamed Item

Cites Work

• A sufficient condition for certain semigroups to be free
• Arithmetic properties of certain recursively defined sets
• An algorithm to determine when certain sets have 0-density
• A packing theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: m-recognizability of sets closed under certain affine functions