23 citations · 52 across the 29 of their papers we have counts for
33 papers
What if we have 90 minutes only to teach programming?
Attila Egri-Nagy
Programming is about automation in a wide variety of domains. Developing itself is one of those. As a side-effect, progress in automated coding may make people less willing to lear…
Measuring the Computational Power of Finite Patches of Cellular Automata
Attila Egri-Nagy, Chrystopher L. Nehaniv
Computational power can be measured by assigning an algebraic structure to a computational device. Here, we convert a small patch of Conway's Game of Life into a transformation sem…
Bringing Algebraic Hierarchical Decompositions to Concatenative Functional Languages
Attila Egri-Nagy
Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not…
Computational Exploration of Finite Semigroupoids
Attila Egri-Nagy, Chrystopher L. Nehaniv
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but…
Representation Independent Decompositions of Computation
Attila Egri-Nagy, Chrystopher L. Nehaniv
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups.…
On Constructing Finite Automata by Relational Programming
Attila Egri-Nagy, Chrystopher L. Nehaniv
We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level…
Morphisms (should be) everywhere
Attila Egri-Nagy, Miklós Hoffmann
Morphisms, structure preserving maps, are everywhere in Mathematics as useful tools for thinking and problem solving, or as objects to study. Here, we argue that the idea of operat…
From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Attila Egri-Nagy, Chrystopher L. Nehaniv
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\…
The cost of passing -- using deep learning AIs to expand our understanding of the ancient game of Go
Attila Egri-Nagy, Antti Törmänen
AI engines utilizing deep learning neural networks provide excellent tools for analyzing traditional board games. Here we are interested in gaining new insights into the ancient ga…
Derived metrics for the game of Go -- intrinsic network strength assessment and cheat-detection
Attila Egri-Nagy, Antti Törmänen
The widespread availability of superhuman AI engines is changing how we play the ancient game of Go. The open-source software packages developed after the AlphaGo series shifted fo…
A path-deformation framework for determining weighted genome rearrangement distance
Sangeeta Bhatia, Attila Egri-Nagy, Stuart Serdoz +3
Measuring the distance between two bacterial genomes under the inversion process is usually done by assuming all inversions to occur with equal probability. Recently, an approach t…
|{Math, Philosophy, Programming, Writing}| = 1
Attila Egri-Nagy
Philosophical thinking has a side effect: by aiming to find the essence of a diverse set of phenomena, it often makes it difficult to see the differences between them. This can be…
The Algebraic View of Computation
Attila Egri-Nagy
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
Declarativeness: the work done by something else
Attila Egri-Nagy
Being declarative means that we do computer programming on higher levels of abstraction. This vague definition identifies declarativeness with the act of ignoring details, but it i…
Finite Computational Structures and Implementations
Attila Egri-Nagy
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and…
Computational Enumeration of Independent Generating Sets of Finite Symmetric Groups
Attila Egri-Nagy, Volker Gebhardt
We developed computer algebra tools for enumerating conjugacy classes of independent subsets and generating sets of symmetric groups up to , and carried out an initial analysi…
Computing Embeddings and Isomorphisms of Finite Semigroups
James East, Attila Egri-Nagy, Andrew R. Francis +1
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus…
Maximum likelihood estimates of pairwise rearrangement distances
Stuart Serdoz, Attila Egri-Nagy, Jeremy Sumner +4
Accurate estimation of evolutionary distances between taxa is important for many phylogenetic reconstruction methods. In the case of bacteria, distances can be estimated using a ra…
Bacterial phylogeny in the Cayley graph
Chad Clark, Attila Egri-Nagy, Andrew R. Francis +1
Many models of genome rearrangement involve operations (e.g. inversions and translocations) that are self-inverse, and hence generate a group acting on the space of genomes. This g…
On the atoms of algebraic lattices arising in -theory
Attila Egri-Nagy, Marcel Jackson, John Rhodes +1
We determine many of the atoms of the algebraic lattices arising in -theory of finite semigroups.
Computing finite semigroups
J. East, A. Egri-Nagy, J. D. Mitchell +1
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that…
Computational Holonomy Decomposition of Transformation Semigroups
Attila Egri-Nagy, Chrystopher L. Nehaniv
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely foll…
Finite Diagram Semigroups: Extending the Computational Horizon
James East, Attila Egri-Nagy, Andrew R. Francis +1
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagra…
SgpDec: Cascade (De)Compositions of Finite Transformation Semigroups and Permutation Groups
Attila Egri-Nagy, James D. Mitchell, Chrystopher L. Nehaniv
We describe how the SgpDec computer algebra package can be used for composing and decomposing permutation groups and transformation semigroups hierarchically by directly constructi…