Inverse semigroup shifts over countable alphabets
نویسندگان
چکیده
منابع مشابه
Arens regularity of inverse semigroup algebras
We present a characterization of Arens regular semigroup algebras $ell^1(S)$, for a large class of semigroups. Mainly, we show that if the set of idempotents of an inverse semigroup $S$ is finite, then $ell^1(S)$ is Arens regular if and only if $S$ is finite.
متن کاملModule cohomology group of inverse semigroup algebras
Let $S$ be an inverse semigroup and let $E$ be its subsemigroup of idempotents. In this paper we define the $n$-th module cohomology group of Banach algebras and show that the first module cohomology group $HH^1_{ell^1(E)}(ell^1(S),ell^1(S)^{(n)})$ is zero, for every odd $ninmathbb{N}$. Next, for a Clifford semigroup $S$ we show that $HH^2_{ell^1(E)}(ell^1(S),ell^1(S)^{(n)})$ is a Banach sp...
متن کاملMorphisms on infinite alphabets, countable states automata and regular sequences
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the regularity of some regular sequences is invariant under some codings.
متن کاملAutomata over Infinite Alphabets
In many contexts such as validation of XML data, software model checking and parametrized verification, the systems studied are naturally abstracted as finite state automata, but whose input alphabet is infinite. While use of such automata for verification requires that the non-emptiness problem be decidable, ensuring this is non-trivial, since the space of configurations of such automata is in...
متن کاملPattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets
Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a single code which is asymptotically minimax over each class in the collection? In particular, adaptive coding makes sense when there is no universal code on the union of classes in the collection. In this paper, we deal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semigroup Forum
سال: 2017
ISSN: 0037-1912,1432-2137
DOI: 10.1007/s00233-017-9858-5