Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Lohrey, Markus
2004.
Developments in Language Theory.
Vol. 3340,
Issue. ,
p.
308.
LOHREY, MARKUS
2005.
DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS.
International Journal of Foundations of Computer Science,
Vol. 16,
Issue. 04,
p.
707.
Hoffmann, Michael
and
Thomas, Richard M.
2007.
Fundamentals of Computation Theory.
Vol. 4639,
Issue. ,
p.
341.
KAMBITES, MARK
2007.
The loop problem for monoids and semigroups.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 143,
Issue. 2,
p.
271.
HOLT, DEREK F.
OWENS, MATTHEW D.
and
THOMAS, RICHARD M.
2008.
GROUPS AND SEMIGROUPS WITH A ONE-COUNTER WORD PROBLEM.
Journal of the Australian Mathematical Society,
Vol. 85,
Issue. 2,
p.
197.
Cain, Alan J.
Oliver, Graham
Ruškuc, Nik
and
Thomas, Richard M.
2009.
Automatic presentations for semigroups.
Information and Computation,
Vol. 207,
Issue. 11,
p.
1156.
Wang, Xiaofeng
Xie, Wanwen
and
Lin, Hanling
2009.
Finiteness and Dehn functions of automatic monoids having directed fellow traveller property.
Semigroup Forum,
Vol. 79,
Issue. 1,
p.
15.
Kambites, Mark
2009.
Small overlap monoids II: Automatic structures and normal forms.
Journal of Algebra,
Vol. 321,
Issue. 8,
p.
2302.
Cain, Alan J.
2009.
Automaton semigroups.
Theoretical Computer Science,
Vol. 410,
Issue. 47-49,
p.
5022.
CASSAIGNE, JULIEN
and
SILVA, PEDRO V.
2009.
INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS.
International Journal of Algebra and Computation,
Vol. 19,
Issue. 04,
p.
443.
Hoffmann, Michael
and
Thomas, Richard M.
2010.
Notions of hyperbolicity in monoids.
Theoretical Computer Science,
Vol. 411,
Issue. 4-5,
p.
799.
Kambites, Mark
2011.
A note on the definition of small overlap monoids.
Semigroup Forum,
Vol. 83,
Issue. 3,
p.
499.
Kambites, Mark
2011.
Generic Complexity of Finitely Presented Monoids and Semigroups.
computational complexity,
Vol. 20,
Issue. 1,
p.
21.
KAMBITES, MARK
2011.
ON UNIFORM DECISION PROBLEMS AND ABSTRACT PROPERTIES OF SMALL OVERLAP MONOIDS.
International Journal of Algebra and Computation,
Vol. 21,
Issue. 01n02,
p.
217.
CAIN, ALAN J.
and
MALTCEV, VICTOR
2012.
CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS.
International Journal of Algebra and Computation,
Vol. 22,
Issue. 07,
p.
1250061.
Hoffmann, Michael
Holt, Derek F.
Owens, Matthew D.
and
Thomas, Richard M.
2012.
Developments in Language Theory.
Vol. 7410,
Issue. ,
p.
97.
Cain, Alan J.
2013.
Hyperbolicity of monoids presented by confluent monadic rewriting systems.
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry,
Vol. 54,
Issue. 2,
p.
593.
Cain, Alan J.
and
Maltcev, Victor
2014.
Finitely presented monoids with linear Dehn function need not have regular cross-sections.
Semigroup Forum,
Vol. 88,
Issue. 2,
p.
300.
Gray, Robert D.
and
Kambites, Mark
2014.
A strong geometric hyperbolicity property for directed graphs and monoids.
Journal of Algebra,
Vol. 420,
Issue. ,
p.
373.
Cain, Alan J.
and
Maltcev, Victor
2014.
Markov semigroups, monoids and groups.
International Journal of Algebra and Computation,
Vol. 24,
Issue. 05,
p.
609.