Перегляд Algebra and Discrete Mathematics, 2011, Vol. 11, № 2 за назвою

Результати 6-7 з 7

Partial actions and automata

Dokuchaev, M.; Novikov, B.; Zholtkevych, G. (Algebra and Discrete Mathematics, 2011)

We use the notion of a partial action of a monoid to introduce a generalization of automata, which we call ``a preautomaton''. We study properties of preautomata and of languages recognized by preautomata.
Partitions of groups into thin subsets

Protasov, I. (Algebra and Discrete Mathematics, 2011)

Let G be an infinite group with the identity e, κ be an infinite cardinal ≤|G|. A subset A⊂G is called κ-thin if |gA∩A|≤κ for every g∈G∖{e}. We calculate the minimal cardinal μ(G,κ) such that G can be partitioned in μ(G,κ) ...

Результати 6-7 з 7

Пошук