On the centralizer of a finite set

DOI10.1007/3-540-45022-X_45MaRDI QIDQ2754174zbMATH OpenFDO

Authors Juhani Karhumäki, Ion Petre

Publication date 6 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45022-X_45

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Conway's problem for three-word sets.
• scientific article; zbMATH DE number 2155196
• The commutation with codes and ternary sets of words
• Commutation with codes
• Commutation with ternary sets of words

Cited in

(16)

• Commutation with ternary sets of words
• Conway's problem for three-word sets.
• A non-ambiguous decomposition of regular languages and factorizing codes
• Playing with Conway's problem
• On structure of domains with quadratic growth.
• Commutation with codes
• Conway's problem and the commutation of languages.
• On Conjugacy of Languages
• On the simplest centralizer of a language
• A central set of dimension $2$
• scientific article; zbMATH DE number 1064681 (Why is no real title available?)
• The commutation with codes and ternary sets of words
• scientific article; zbMATH DE number 2155196 (Why is no real title available?)
• On circumcenters of finite sets in Hilbert spaces
• The power of commuting with finite sets of words
• Aspects of Molecular Computing

This page was built for publication: On the centralizer of a finite set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754174)