相关论文: The Warwick Automatic Groups Software

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

The broader goal of this research, on the one hand, is to obtain the State of the Art in Automated Test Production (ATP), to find the open questions and related problems and to track the progress of researchers in the field, and on the…

We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets containing up to billions of…

This paper describes a general framework for automatic termination analysis of logic programs, where we understand by ``termination'' the finitenes s of the LD-tree constructed for the program and a given query. A general property of…

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

This paper summarizes the fundamental expressiveness, closure, and decidability properties of various finite-state automata classes with multiple input tapes. It also includes an original algorithm for the intersection of one-way…

We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…

A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…

We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic…

Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values in XML documents. We introduce active learning methods for…

Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…

Large Language Models (LLMs) have demonstrated the ability to solve a wide range of practical tasks within multi-agent systems. However, existing human-designed multi-agent frameworks are typically limited to a small set of pre-defined…

We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…

This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…

Here I present the freegroup package for working with the free group on a finite set of symbols. The package is vectorised; internally it uses an efficient matrix-based representation for free group objects but uses a configurable print…

In this document, some novel theoretical and computational techniques for constrained approximation of data-driven systems, are presented. The motivation for the development of these techniques came from structure-preserving matrix…

Let W~ be an affine Weyl group, and let C be a left, right, or two-sided Kazhdan--Lusztig cell in W~. Let Reduced (C) be the set of all reduced expressions of elements of C, regarded as a formal language in the sense of the theory of…

We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach,…