![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Alan J. Cain
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j18]Alan J. Cain, Erkko Lehtonen:
Reconstructing Young tableaux. J. Comb. Theory A 187: 105578 (2022) - 2020
- [j17]Tara Brough
, Alan J. Cain
:
A language hierarchy of binary relations. Inf. Comput. 275: 104607 (2020) - 2019
- [j16]Alan J. Cain, António Malheiro
, Fábio M. Silva:
Combinatorics of patience sorting monoids. Discret. Math. 342(9): 2590-2611 (2019) - [j15]Alan J. Cain, António Malheiro
, Fábio M. Silva:
The monoids of the patience sorting algorithm. Int. J. Algebra Comput. 29(1): 85-125 (2019) - [j14]Alan J. Cain
, Robert D. Gray, António Malheiro
:
Crystal monoids & crystal bases: Rewriting systems and biautomatic structures for plactic monoids of types An, Bn, Cn, Dn, and G2. J. Comb. Theory A 162: 406-466 (2019) - 2018
- [j13]Alan J. Cain
, António Malheiro
:
Identities in Plactic, Hypoplactic, Sylvester, Baxter, and Related Monoids. Electron. J. Comb. 25(3): 3 (2018) - 2017
- [j12]Alan J. Cain
, Robert D. Gray, António Malheiro
:
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids. Inf. Comput. 255: 68-93 (2017) - [j11]Tara Brough
, Alan J. Cain
:
Automaton semigroups: New constructions results and examples of non-automaton semigroups. Theor. Comput. Sci. 674: 1-15 (2017) - 2015
- [j10]Alan J. Cain
, Robert D. Gray, António Malheiro
:
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids. Int. J. Algebra Comput. 25(1-2): 51-80 (2015) - [j9]Alan J. Cain
, António Malheiro
:
Deciding conjugacy in sylvester monoids and other homogeneous monoids. Int. J. Algebra Comput. 25(5): 899-915 (2015) - 2014
- [j8]Alan J. Cain
, Victor Maltcev:
Markov semigroups, monoids and groups. Int. J. Algebra Comput. 24(5): 609-654 (2014) - 2012
- [j7]Alan J. Cain
, Nikola Ruskuc
, Richard M. Thomas:
Unary FA-Presentable Semigroups. Int. J. Algebra Comput. 22(4) (2012) - [j6]Alan J. Cain
, Victor Maltcev:
Context-Free Rewriting Systems and Word-hyperbolic Structures with uniqueness. Int. J. Algebra Comput. 22(7) (2012) - 2010
- [j5]Alan J. Cain
, Graham P. Oliver, Nikola Ruskuc
, Richard M. Thomas:
Automatic Presentations and Semigroup Constructions. Theory Comput. Syst. 47(2): 568-592 (2010) - 2009
- [j4]Alan J. Cain
, Graham P. Oliver, Nikola Ruskuc
, Richard M. Thomas:
Automatic presentations for semigroups. Inf. Comput. 207(11): 1156-1168 (2009) - [j3]Alan J. Cain
, Victor Maltcev:
Decision Problems for Finitely Presented and One-Relation Semigroups and Monoids. Int. J. Algebra Comput. 19(6): 747-770 (2009) - [j2]Alan J. Cain
:
Monoids Presented by Rewriting Systems and Automatic Structures for their Submonoids. Int. J. Algebra Comput. 19(6): 771-790 (2009) - [j1]Alan J. Cain
:
Automaton semigroups. Theor. Comput. Sci. 410(47-49): 5022-5038 (2009)
Conference and Workshop Papers
- 2019
- [c3]Tara Brough
, Alan J. Cain
, Markus Pfeiffer
:
Context-Free Word Problem Semigroups. DLT 2019: 292-305 - 2017
- [c2]Alan J. Cain
, António Malheiro
:
Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids. WORDS 2017: 190-202 - 2008
- [c1]Alan J. Cain
, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations for Cancellative Semigroups. LATA 2008: 149-159
Informal and Other Publications
- 2019
- [i11]Tara Brough, Alan J. Cain, Markus Pfeiffer:
Context-free word problem semigroups. CoRR abs/1903.10493 (2019) - 2018
- [i10]Tara Brough, Alan J. Cain:
A Language Hierarchy of Binary Relations. CoRR abs/1805.03125 (2018) - 2016
- [i9]Tara Brough, Alan J. Cain:
Automaton semigroups: new construction results and examples of non-automaton semigroups. CoRR abs/1601.01168 (2016) - 2014
- [i8]Alan J. Cain, Robert D. Gray, António Malheiro:
On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids. CoRR abs/1407.7428 (2014) - [i7]Alan J. Cain, Robert D. Gray, António Malheiro
:
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 abs/1412.7040 (2014) - 2013
- [i6]Alan J. Cain:
Decision problems for word-hyperbolic semigroups. CoRR abs/1303.1763 (2013) - [i5]Tara Brough, Alan J. Cain:
Automaton semigroup constructions. CoRR abs/1310.4852 (2013) - [i4]Alan J. Cain, Robert D. Gray, António Malheiro:
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids. CoRR abs/1310.6572 (2013) - 2012
- [i3]Alan J. Cain, Victor Maltcev:
Markov semigroups, monoids, and groups. CoRR abs/1202.3013 (2012) - [i2]Alan J. Cain, Victor Maltcev:
Finitely presented monoids with linear Dehn function need not have regular cross-sections. CoRR abs/1203.0473 (2012) - [i1]Alan J. Cain, Nikola Ruskuc:
Subalgebras of FA-presentable algebras. CoRR abs/1206.5548 (2012)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint