Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kuske, Dietrich
2001.
Fundamentals of Computation Theory.
Vol. 2138,
Issue. ,
p.
227.
Dehornoy, Patrick
2003.
Complete positive group presentations.
Journal of Algebra,
Vol. 268,
Issue. 1,
p.
156.
Picantin, Matthieu
2006.
Finite transducers for divisibility monoids.
Theoretical Computer Science,
Vol. 362,
Issue. 1-3,
p.
207.
Droste, Manfred
Sakarovitch, Jacques
and
Vogler, Heiko
2008.
Weighted automata with discounting.
Information Processing Letters,
Vol. 108,
Issue. 1,
p.
23.
Fichtner, Ina
Kuske, Dietrich
and
Meinecke, Ingmar
2009.
Handbook of Weighted Automata.
p.
405.
Fichtner, Ina
and
Mathissen, Christian
2011.
Algebraic Foundations in Computer Science.
Vol. 7020,
Issue. ,
p.
94.
GRAY, ROBERT D.
and
KAMBITES, MARK
2013.
QUASI-ISOMETRY AND FINITE PRESENTATIONS OF LEFT CANCELLATIVE MONOIDS.
International Journal of Algebra and Computation,
Vol. 23,
Issue. 05,
p.
1099.
Kunc, Michal
and
Meitner, Jan
2017.
Developments in Language Theory.
Vol. 10396,
Issue. ,
p.
247.
Corbet, René
and
Kerber, Michael
2018.
The representation theorem of persistence revisited and generalized.
Journal of Applied and Computational Topology,
Vol. 2,
Issue. 1-2,
p.
1.
Kunc, Michal
and
Meitner, Jan
2019.
The Generalized Rank of Trace Languages.
International Journal of Foundations of Computer Science,
Vol. 30,
Issue. 01,
p.
135.