Alan J. Cain

Erkko Lehtonen

J. Comb. Theory A, 2022

2020

A language hierarchy of binary relations.

[BibT_eX]

[DOI]

Inf. Comput., 2020

2019

Crystal monoids & crystal bases: Rewriting systems and biautomatic structures for plactic monoids of types An, Bn, Cn, Dn, and G2.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

The monoids of the patience sorting algorithm.

[BibT_eX]

[DOI]

Fábio M. Silva

Int. J. Algebra Comput., 2019

Combinatorics of patience sorting monoids.

[BibT_eX]

[DOI]

Fábio M. Silva

Discret. Math., 2019

Context-Free Word Problem Semigroups.

[BibT_eX]

[DOI]

Markus Pfeiffer

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Identities in Plactic, Hypoplactic, Sylvester, Baxter, and Related Monoids.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

Automaton semigroups: New constructions results and examples of non-automaton semigroups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Automaton semigroups: new construction results and examples of non-automaton semigroups.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Deciding conjugacy in sylvester monoids and other homogeneous monoids.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2015

Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2015

2014

Markov semigroups, monoids and groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2014

Crystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Decision problems for word-hyperbolic semigroups

[BibT_eX]

[DOI]

CoRR, 2013

Automaton semigroup constructions.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Unary FA-Presentable Semigroups.

[BibT_eX]

[DOI]

Nikola Ruskuc

Richard M. Thomas

Int. J. Algebra Comput., 2012

Context-Free Rewriting Systems and Word-hyperbolic Structures with uniqueness.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2012

Subalgebras of FA-presentable algebras

[BibT_eX]

[DOI]

Nikola Ruskuc

CoRR, 2012

Finitely presented monoids with linear Dehn function need not have regular cross-sections

[BibT_eX]

[DOI]

CoRR, 2012

2010

Automatic Presentations and Semigroup Constructions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

2009

Automaton semigroups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Decision Problems for Finitely Presented and One-Relation Semigroups and Monoids.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2009

Monoids Presented by Rewriting Systems and Automatic Structures for their Submonoids.

[BibT_eX]

[DOI]