A. Woryna

activity

20162022

most citedThe concept of duality for automata over a changing alphabet and generation of a free group by such automata

7 citations · 25 across the 9 of their papers we have counts for

collaborators

9 papers

math.CO2022

On the bijective colouring of Cantor trees based on transducers

Adam Woryna

Given a vertex colouring of the infinite $n$ -ary Cantor tree with $m$ colours ( $n, m \geq 2$ ), the natural problem arises: may this colouring induce a bijective colouring of the infi…

math.CO2020

On the proportion of prefix codes in the set of three-element codes

Adam Woryna

Let $L$ be a finite sequence of natural numbers. In Woryna (2017,2018), we derived some interesting properties for the ratio $ρ_{n, L} = ∣ P R_{n} (L) ∣/∣ U D_{n} (L) ∣$ , where $U D_{n} (L)$ denotes…

math.CO2018★ 2 cited

On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

Adam Woryna

We investigate the ratio $ρ_{n, L}$ of prefix codes to all uniquely decodable codes over an $n$ -letter alphabet and with length distribution $L$ . For any integers $n \geq 2$ and $m\g…

math.GR2017★ 1 cited

On groups generated by bi-reversible automata: the two-state case over a changing alphabet

Adam Woryna

The notion of an automaton over a changing alphabet $X = (X_{i})_{i \geq 1}$ is used to define and study automorphism groups of the tree $X^{*}$ of finite words over $X$ . The concept of b…

cs.IT2016★ 3 cited

On the set of uniquely decodable codes with a given sequence of code word lengths

Adam Woryna

For every natural number $n \geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $U D_{n} (L)$ of all uniquely decodable codes over an $n$ -letter alphabet with…

math.GR2016★ 1 cited

The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet

Adam Woryna

For every natural number $n$ , we classify abelian groups generated by an $n$ -state time-varying automaton over the binary alphabet, as well as by an $n$ -state Mealy automaton over…