Zobrazeno 1 - 10
of 404
pro vyhledávání: '"Woryna P"'
Autor:
Woryna, Adam
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 infinite paths starting at the root, i.e., that every infinite $m$-coloure
Externí odkaz:
http://arxiv.org/abs/2202.10131
Autor:
Woryna, Adam
Publikováno v:
Discrete Mathematics 343 (2020) 111939
Let $L$ be a finite sequence of natural numbers. In Woryna (2017,2018), we derived some interesting properties for the ratio $\rho_{n,L}=|PR_n(L)|/|UD_n(L)|$, where $UD_n(L)$ denotes the set of all codes over an $n$-letter alphabet and with length di
Externí odkaz:
http://arxiv.org/abs/2005.00301
Autor:
Woryna, Adam
We investigate the ratio $\rho_{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\geq 1$, we construct a lower bound and an upper bound for $\inf_L\rh
Externí odkaz:
http://arxiv.org/abs/1804.02531
Autor:
Anna-Lena Gippert, Silvia Madritsch, Patrick Woryna, Sandra Otte, Martina Mayrhofer, Herbert Eigner, Adriana Garibay-Hernández, John C. D’Auria, Eva M. Molin, Hans-Peter Mock
Publikováno v:
BMC Plant Biology, Vol 22, Iss 1, Pp 1-18 (2022)
Abstract Background Sugar beet is an important crop for sugar production. Sugar beet roots are stored up to several weeks post-harvest waiting for processing in the sugar factories. During this time, sucrose loss and invert sugar accumulation decreas
Externí odkaz:
https://doaj.org/article/b974f1f37ae2490b9d35ef1076c11724
Autor:
Woryna, Adam
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 bi-reversibility for Mealy-type automata is extended to automata over a
Externí odkaz:
http://arxiv.org/abs/1702.00435
Autor:
Woryna, Adam
Publikováno v:
Discrete Mathematics 340 (2017), pp. 51-57
For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as well as its
Externí odkaz:
http://arxiv.org/abs/1608.08381
Autor:
Woryna, Adam
Publikováno v:
Theor Comput Sci 412 (2011) 6420-6431
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 a dual automaton and its action used by B. Steinberg et al. (2011) and
Externí odkaz:
http://arxiv.org/abs/1607.07644
Autor:
Woryna, Adam
Publikováno v:
Inform Comput 249(2016)18-27
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 the binary alphabet.
Externí odkaz:
http://arxiv.org/abs/1607.07653
Autor:
Woryna, Adam
Publikováno v:
Theory Comput Sci 482 (2013) 96-110
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 show that every finitely generated residually-finite group is self-simila
Externí odkaz:
http://arxiv.org/abs/1607.07650