Most cited
This page lists all time most cited articles for this title. Please use the publication date filters on the left if you would like to restrict this list to recently published content, for example to articles published in the last three years. The number of times each article was cited is displayed to the right of its title and can be clicked to access a list of all titles this article has been cited by.
 Cited by 125
Adhesive and quasiadhesive categories

 Published online by Cambridge University Press:
 15 July 2005, pp. 511545

 Article
 Export citation
 Cited by 78
A sharpening of the Parikh mapping

 Published online by Cambridge University Press:
 15 July 2002, pp. 551564

 Article
 Export citation
 Cited by 66
Learning deterministic regular grammars from stochastic samples in polynomial time

 Published online by Cambridge University Press:
 15 August 2002, pp. 119

 Article
 Export citation
 Cited by 56
Return words in Sturmian and episturmian words

 Published online by Cambridge University Press:
 15 April 2002, pp. 343356

 Article
 Export citation
 Cited by 54
ManySorted Coalgebraic Modal Logic: a Modeltheoretic Study

 Published online by Cambridge University Press:
 15 April 2002, pp. 3159

 Article
 Export citation
 Cited by 52
On the equivalence of linear conjunctive grammars and trellis automata

 Published online by Cambridge University Press:
 15 March 2004, pp. 6988

 Article
 Export citation
 Cited by 50
Division in logspaceuniform NC1

 Published online by Cambridge University Press:
 15 April 2002, pp. 259275

 Article
 Export citation
 Cited by 46
Probabilistic operational semantics for the lambda calculus

 Published online by Cambridge University Press:
 22 June 2012, pp. 413450

 Article
 Export citation
 Cited by 46
Episturmian words: a survey

 Published online by Cambridge University Press:
 06 March 2009, pp. 403442

 Article
 Export citation
 Cited by 42
The μcalculus alternationdepth hierarchy is strict on binary trees

 Published online by Cambridge University Press:
 15 August 2002, pp. 329339

 Article
 Export citation
 Cited by 41
Measuring the problemrelevant information in input

 Published online by Cambridge University Press:
 04 April 2009, pp. 585613

 Article
 Export citation
 Cited by 40
Permissive strategies: from parity games to safety games

 Published online by Cambridge University Press:
 15 December 2002, pp. 261275

 Article
 Export citation
 Cited by 31
A generator of morphisms for infinite words

 Published online by Cambridge University Press:
 18 October 2006, pp. 427441

 Article
 Export citation
 Cited by 31
Polynomials over the reals in proofs of termination : from theory to practice

 Published online by Cambridge University Press:
 15 July 2005, pp. 547586

 Article
 Export citation
 Cited by 31
On Christoffel classes

 Published online by Cambridge University Press:
 15 October 2005, pp. 1527

 Article
 Export citation
 Cited by 30
Computing ϵFree NFA from Regular Expressions in O(n log2(n)) Time

 Published online by Cambridge University Press:
 15 April 2002, pp. 257277

 Article
 Export citation
 Cited by 30
Advice Complexity and Barely Random Algorithms

 Published online by Cambridge University Press:
 24 June 2011, pp. 249267

 Article
 Export citation
 Cited by 30
On a paper by Castelli, Mignosi, Restivo

 Published online by Cambridge University Press:
 15 April 2002, pp. 373377

 Article
 Export citation
 Cited by 30
Episturmian morphisms and a Galois theorem on continued fractions

 Published online by Cambridge University Press:
 15 March 2005, pp. 207215

 Article
 Export citation
 Cited by 28
State complexity of cyclic shift

 Published online by Cambridge University Press:
 13 December 2007, pp. 335360

 Article
 Export citation