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 6
On the Horton-Strahler Number for Combinatorial Tries
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 279-296
-
- Article
- Export citation
- Cited by 6
Undecidability of the equivalence of finite substitutions on regular language
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 117-124
-
- Article
- Export citation
- Cited by 6
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 277-286
-
- Article
- Export citation
- Cited by 6
Decidability of code properties
-
- Published online by Cambridge University Press:
- 25 September 2007, pp. 243-259
-
- Article
- Export citation
- Cited by 6
A Fully Equational Proof of Parikh's Theorem
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 129-153
-
- Article
- Export citation
- Cited by 6
On the number of iterations required by Von Neumann addition
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 187-206
-
- Article
- Export citation
- Cited by 6
Iteration of rational transductions
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 99-129
-
- Article
- Export citation
- Cited by 6
Square-root rule of two-dimensional bandwidth problem∗
-
- Published online by Cambridge University Press:
- 22 September 2011, pp. 399-411
-
- Article
- Export citation
- Cited by 5
On Sequences Defined by D0L Power Series
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 125-132
-
- Article
- Export citation
- Cited by 5
Computing the jth solution of a first-order query
-
- Published online by Cambridge University Press:
- 18 January 2008, pp. 147-164
-
- Article
- Export citation
- Cited by 5
On the median-of-k version of Hoare's selection algorithm
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 177-192
-
- Article
- Export citation
- Cited by 5
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 287-309
-
- Article
- Export citation
- Cited by 5
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store⋆⋆⋆
-
- Published online by Cambridge University Press:
- 07 October 2011, pp. 413-448
-
- Article
- Export citation
- Cited by 5
Random Generation for Finitely Ambiguous Context-free Languages
-
- Published online by Cambridge University Press:
- 15 July 2002, pp. 499-512
-
- Article
- Export citation
- Cited by 5
Combinatoire de mots récurrents de complexité n+2
-
- Published online by Cambridge University Press:
- 25 September 2007, pp. 425-446
-
- Article
- Export citation
- Cited by 5
Commutative images of rational languages and the Abelian kernel of a monoid
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 419-435
-
- Article
- Export citation
- Cited by 5
On automatic infinite permutations∗
-
- Published online by Cambridge University Press:
- 23 November 2011, pp. 77-85
-
- Article
- Export citation
- Cited by 5
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
-
- Published online by Cambridge University Press:
- 15 March 2005, pp. 175-189
-
- Article
- Export citation
- Cited by 5
A little more about morphic Sturmian words
-
- Published online by Cambridge University Press:
- 18 October 2006, pp. 511-518
-
- Article
- Export citation
- Cited by 5
Fixpoints, games and the difference hierarchy
-
- Published online by Cambridge University Press:
- 15 November 2003, pp. 1-15
-
- Article
- Export citation