#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2006

2017

- This year (3)
- Last 5 years (6)
- Last 10 years (7)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Adam Woryna
- Theor. Comput. Sci.
- 2011

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 M. Vorobets and Ya. Vorobets (2007, 2010) [16–18] and adapt them to automata over a changing alphabet. We… (More)

- Adam Woryna
- IJAC
- 2006

- Adam Woryna
- Theor. Comput. Sci.
- 2013

Generalizing the idea of self-similar groups defined by Mealy automata, we introduce 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-similar over an arbitrary unbounded changing alphabet. We construct some naturally defined self-similar automaton… (More)

- Adam Woryna
- Inf. Comput.
- 2016

- Adam Woryna
- LATA
- 2012

- Adam Woryna, Adam Woryna
- 2006

In the group theory various representations of free groups are used. A representation of a free group of rank two by the so-called time-varying Mealy automata over the changing alphabet is given. Two different constructions of such automata are presented.

- Adam Woryna
- J. Comput. Syst. Sci.
- 2017

Article history: Received 20 July 2016 Received in revised form 28 December 2016 Accepted 11 January 2017 Available online 20 January 2017

- Adam Woryna
- Discrete Mathematics
- 2017

For every natural number n ≥ 2 and every finite sequence L of natural numbers, we consider the set UDn(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 subsets PRn(L) and FDn(L) consisting of, respectively, the prefix codes and the codes with finite delay. We derive the… (More)

- Adam Woryna
- J. Comb. Optim.
- 2017

- ‹
- 1
- ›