Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Veronika Prokhorchuk"'
Autor:
Veronika Prokhorchuk
Publikováno v:
Theoretical Computer Science. 856:151-164
Groups of automaton permutations over finite alphabets are considered. Finite automata over minimal possible alphabets that define amalgamated free products of finite cyclic groups are constructed. For any prime p the case of amalgamated free product
Publikováno v:
DESSERT
Nowadays, special interest is taken on transparent and reliable user authentication on mobile devices. Variety of proposed authentication methods allows developers to choose flexibly authentication methods according to predefined accuracy, usability