11 citations · 14 across the 7 of their papers we have counts for
7 papers
Irreducibility of Endomorphisms of Finitely Generated Free Semigroups
Paul C. Bell, Eva Foster, Daniel Reidenbach
We introduce and investigate the irreducibility of endomorphisms of finitely generated free semigroups, i.e., we investigate when an endomorphism , where is any…
Factorisability of Low Dimensional Non-Negative Integer Matrices
Paul C. Bell, Eva Foster, Daniel Reidenbach +1
We consider the problem of determining if a given two-dimensional nonnegative integer matrix is the product of two such matrices, excluding trivial units. A matrix with no…
Irreducibility of Endomorphisms of Finitely Generated Free Semigroups
Paul C. Bell, Eva Foster, Daniel Reidenbach
We introduce and investigate the irreducibility of endomorphisms of finitely generated free semigroups, i.e., we investigate when an endomorphism , where is any…
Improving Small Molecule Generation using Mutual Information Machine
Danny Reidenbach, Micha Livne, Rajesh K. Ilango +2
We address the task of controlled generation of small molecules, which entails finding novel molecules with desired properties under certain constraints (e.g., similarity to a refe…
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
Daniel Reidenbach, Markus L. Schmid
In the present paper, we study the match test for extended regular expressions. We approach this NP-complete problem by introducing a novel variant of two-way multihead automata, w…
Factorization in Formal Languages
Paul Bell, Daniel Reidenbach, Jeffrey Shallit
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of…
Unambiguous 1-Uniform Morphisms
Hossein Nevisi, Daniel Reidenbach
A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for…