Alan J. Cain

Orcid: 0000-0002-0706-1354

According to our database1, Alan J. Cain authored at least 27 papers between 2008 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Reconstructing Young tableaux.
J. Comb. Theory A, 2022

2020
A language hierarchy of binary relations.
Inf. Comput., 2020

2019
Crystal monoids & crystal bases: Rewriting systems and biautomatic structures for plactic monoids of types <i>A</i><sub><i>n</i></sub>, <i>B</i><sub><i>n</i></sub>, <i>C</i><sub><i>n</i></sub>, <i>D</i><sub><i>n</i></sub>, and <i>G</i><sub>2</sub>.
J. Comb. Theory A, 2019

The monoids of the patience sorting algorithm.
Int. J. Algebra Comput., 2019

Combinatorics of patience sorting monoids.
Discret. Math., 2019

Context-Free Word Problem Semigroups.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018
Identities in Plactic, Hypoplactic, Sylvester, Baxter, and Related Monoids.
Electron. J. Comb., 2018

2017
Automaton semigroups: New constructions results and examples of non-automaton semigroups.
Theor. Comput. Sci., 2017

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

Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

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

2015
Deciding conjugacy in sylvester monoids and other homogeneous monoids.
Int. J. Algebra Comput., 2015

Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids.
Int. J. Algebra Comput., 2015

2014
Markov semigroups, monoids and groups.
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$.
CoRR, 2014

2013
Decision problems for word-hyperbolic semigroups
CoRR, 2013

Automaton semigroup constructions.
CoRR, 2013

2012
Unary FA-Presentable Semigroups.
Int. J. Algebra Comput., 2012

Context-Free Rewriting Systems and Word-hyperbolic Structures with uniqueness.
Int. J. Algebra Comput., 2012

Subalgebras of FA-presentable algebras
CoRR, 2012

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

2010
Automatic Presentations and Semigroup Constructions.
Theory Comput. Syst., 2010

2009
Automaton semigroups.
Theor. Comput. Sci., 2009

Decision Problems for Finitely Presented and One-Relation Semigroups and Monoids.
Int. J. Algebra Comput., 2009

Monoids Presented by Rewriting Systems and Automatic Structures for their Submonoids.
Int. J. Algebra Comput., 2009

Automatic presentations for semigroups.
Inf. Comput., 2009

2008
Automatic Presentations for Cancellative Semigroups.
Proceedings of the Language and Automata Theory and Applications, 2008


  Loading...