default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard M. Thomas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Sam A. M. Jones, Richard M. Thomas:
Word problems of groups: Formal languages, characterizations and decidability. Theor. Comput. Sci. 750: 2-23 (2018)- 2016
- [c11]Sam A. M. Jones, Richard M. Thomas:
Characterizing Word Problems of Groups. RP 2016: 104-118 - 2015
- [c10]Gabriela Asli Rino Nesin, Richard M. Thomas:
Groups Whose Word Problem is a Petri Net Language. DCFS 2015: 243-255 - 2013
- [j13]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
On the automaticity of singular Artin monoids of finite type. Int. J. Comput. Math. 90(6): 1197-1222 (2013) - [c9]Gabriela Asli Rino Nesin, Richard M. Thomas:
Groups with a Recursively Enumerable Irreducible Word Problem. FCT 2013: 283-292 - [c8]Sam A. M. Jones, Richard M. Thomas:
Formal Languages, Word Problems of Groups and Decidability. RP 2013: 146-158 - 2012
- [j12]Alan J. Cain
, Nikola Ruskuc, Richard M. Thomas:
Unary FA-Presentable Semigroups. Int. J. Algebra Comput. 22(4) (2012) - [c7]Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas:
Semigroups with a Context-Free Word Problem. Developments in Language Theory 2012: 97-108 - 2011
- [c6]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA 2011: 250-261 - 2010
- [j11]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations and Semigroup Constructions. Theory Comput. Syst. 47(2): 568-592 (2010) - [j10]Michael Hoffmann, Richard M. Thomas:
Notions of hyperbolicity in monoids. Theor. Comput. Sci. 411(4-5): 799-811 (2010)
2000 – 2009
- 2009
- [j9]Stephen R. Lakin, Richard M. Thomas:
Space Complexity and Word Problems of Groups. Groups Complex. Cryptol. 1(2): 261-273 (2009) - [j8]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic presentations for semigroups. Inf. Comput. 207(11): 1156-1168 (2009) - 2008
- [c5]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations for Cancellative Semigroups. LATA 2008: 149-159 - 2007
- [c4]Michael Hoffmann, Richard M. Thomas:
Notions of Hyperbolicity in Monoids. FCT 2007: 341-352 - 2006
- [j7]Michael Hoffmann, Richard M. Thomas:
A geometric characterization of automatic semigroups. Theor. Comput. Sci. 369(1-3): 300-313 (2006) - 2005
- [c3]Michael Hoffmann, Richard M. Thomas:
Biautomatic Semigroups. FCT 2005: 56-67 - [c2]Graham P. Oliver, Richard M. Thomas:
Automatic Presentations for Finitely Generated Groups. STACS 2005: 693-704 - 2004
- [j6]Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas:
Monoid presentations of groups by finite special string-rewriting systems. RAIRO Theor. Informatics Appl. 38(3): 245-256 (2004) - [c1]Stephen R. Lakin, Richard M. Thomas:
Context-Sensitive Decision Problems in Groups. Developments in Language Theory 2004: 296-307 - 2002
- [j5]Michael Hoffmann, Richard M. Thomas, Nikola Ruskuc:
Automatic Semigroups with Subsemigroups of Finite Rees Index. Int. J. Algebra Comput. 12(3): 463-461 (2002) - 2001
- [j4]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
Automatic semigroups. Theor. Comput. Sci. 250(1-2): 365-391 (2001)
1990 – 1999
- 1996
- [j3]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
On Subsemigroups and ideals in Free Products of Semigroups. Int. J. Algebra Comput. 6(5): 571-592 (1996) - 1995
- [j2]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
Rewriting a Semigroup Presentation. Int. J. Algebra Comput. 5(1): 81-104 (1995) - 1993
- [j1]Thomas Herbst, Richard M. Thomas:
Group Presentations, Formal Languages and Characterizations of One-Counter Groups. Theor. Comput. Sci. 112(2): 187-213 (1993)
Coauthor Index
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-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
