7 citations · 25 across the 9 of their papers we have counts for
5 papers · 1 filter
On the set of uniquely decodable codes with a given sequence of code word lengths
Adam Woryna
For every natural number and every finite sequence of natural numbers, we consider the set of all uniquely decodable codes over an -letter alphabet with…
The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet
Adam Woryna
For every natural number , we classify abelian groups generated by an -state time-varying automaton over the binary alphabet, as well as by an -state Mealy automaton over…
The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
Adam Woryna
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We sho…
The concept of duality for automata over a changing alphabet and generation of a free group by such automata
Adam Woryna
In the paper, we deal with the notion of an automaton over a changing alphabet, which generalizes the concept of a Mealy-type automaton. We modify the methods based on the idea of…
The solution of a generalized secretary problem via analytic expressions
Adam Woryna
Given integers , the Gusein-Zade version of a generalized secretary problem is to choose one of the best of candidates for a secretary, which are interviewing in…