On the Problem of Computing the Probability of Regular Sets of Trees

We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which computes the probability of languages recognizable by \emph{game automata}. In particular this algorithm is applicable to all deterministic automata. We then use the algorithm to prove through examples three properties of measure: (1) there exist regular sets having irrational probability, (2) there exist comeager regular sets having probability $0$ and (3) the probability of \emph{game languages} $W_{i,k}$, from automata theory, is $0$ if $k$ is odd and is $1$ otherwise

Cel nauczania a dobór materiału

Zadanie pt. Digitalizacja i udostępnienie w Cyfrowym Repozytorium Uniwersytetu Łódzkiego kolekcji czasopism naukowych wydawanych przez Uniwersytet Łódzki nr 885/P-DUN/2014 zostało dofinansowane ze środków MNiSW w ramach działalności upowszechniającej naukę

Atari games and Intel processors

The asynchronous nature of the state-of-the-art reinforcement learning algorithms such as the Asynchronous Advantage Actor-Critic algorithm, makes them exceptionally suitable for CPU computations. However, given the fact that deep reinforcement learning often deals with interpreting visual information, a large part of the train and inference time is spent performing convolutions. In this work we present our results on learning strategies in Atari games using a Convolutional Neural Network, the Math Kernel Library and TensorFlow 0.11rc0 machine learning framework. We also analyze effects of asynchronous computations on the convergence of reinforcement learning algorithms

Autoprezentacja i prezentacja w mediach

Udostępnienie publikacji Wydawnictwa Uniwersytetu Łódzkiego finansowane w ramach projektu „Doskonałość naukowa kluczem do doskonałości kształcenia”. Projekt realizowany jest ze środków Europejskiego Funduszu Społecznego w ramach Programu Operacyjnego Wiedza Edukacja Rozwój; nr umowy: POWER.03.05.00-00-Z092/17-00

Analiza językowa tekstu prawniczego

It is an analysis of the grounds of a certain court order. The text contains numerous linguisticdeficiencies. Among them are: typing errors, spelling mistakes, punctuation, flexographic,lexical and syntactical errors. Undeniably they harm the prestige of the office whichsigned the document and make it more difficult to interpret the decisions of such an office.Albeit the result of the analysis of one legal writing does not entitle to making generalizations,however it encourages linguists to become interested in this category of speech.It is an analysis of the grounds of a certain court order. The text contains numerous linguistic deficiencies. Among them are: typing errors, spelling mistakes, punctuation, flexographic, lexical and syntactical errors. Undeniably they harm the prestige of the office which signed the document and make it more difficult to interpret the decisions of such an office. Albeit the result of the analysis of one legal writing does not entitle to making generalizations, however it encourages linguists to become interested in this category of speech