Quasi-automatic groups are asynchronously automatic

06/04/2019
by   Benjamin Blanchette, et al.
0

A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a quasi-automatic semigroup for which these rational relations are also recognisable by two-tape automata. We show that when such a semigroup happens to be a group, the converse actually holds, meaning quasi-automatic groups are asynchronously automatic.

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

06/06/2019

Quasi-automatic semigroups

A quasi-automatic semigroup is defi0ned by a finite set of generators, a...
06/11/2020

Quasi-independence models with rational maximum likelihood estimates

We classify the two-way independence quasi-independence models (or indep...
01/28/2018

Characterisation of (Sub)sequential Rational Functions over a General Class Monoids

In this technical report we describe a general class of monoids for whic...
09/21/2021

An Add-On for Empowering Google Forms to be an Automatic Question Generator in Online Assessments

This research suggests an add-on to empower Google Forms to be an automa...
03/16/2017

Ultimate Positivity of Diagonals of Quasi-rational Functions

The problem to decide whether a given multivariate (quasi-)rational func...
07/05/2019

Rational Krylov and ADI iteration for infinite size quasi-Toeplitz matrix equations

We consider a class of linear matrix equations involving semi-infinite m...
05/07/2019

The strong approximation theorem and computing with linear groups

We obtain a computational realization of the strong approximation theore...

References