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 1
Preface
-
- Published online by Cambridge University Press:
- 15 March 2005, pp. I-VII
-
- Article
- Export citation
- Cited by 1
Morphisms fixing words associated with exchange of three intervals
-
- Published online by Cambridge University Press:
- 11 February 2010, pp. 3-17
-
- Article
- Export citation
- Cited by 1
Compatibility relations on codes and free monoids
-
- Published online by Cambridge University Press:
- 03 June 2008, pp. 539-552
-
- Article
- Export citation
- Cited by 1
Squares and cubes in Sturmian sequences
-
- Published online by Cambridge University Press:
- 06 March 2009, pp. 615-624
-
- Article
- Export citation
- Cited by 1
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 21-31
-
- Article
- Export citation
- Cited by 1
The compositional construction of Markov processes II
-
- Published online by Cambridge University Press:
- 15 March 2011, pp. 117-142
-
- Article
- Export citation
- Cited by 1
A tight bound for exhaustive key search attacks against Message Authentication Codes
-
- Published online by Cambridge University Press:
- 06 November 2012, pp. 171-180
-
- Article
- Export citation
- Cited by 1
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 229-247
-
- Article
- Export citation
- Cited by 1
Polynomial languages with finite antidictionaries
-
- Published online by Cambridge University Press:
- 22 November 2008, pp. 269-279
-
- Article
- Export citation
- Cited by 1
Three complexity functions
-
- Published online by Cambridge University Press:
- 23 November 2011, pp. 67-76
-
- Article
- Export citation
- Cited by 1
On Core XPath with Inflationary Fixed Points∗
-
- Published online by Cambridge University Press:
- 19 December 2012, pp. 3-23
-
- Article
- Export citation
- Cited by 1
Linear spans of optimal sets of frequency hopping sequences∗
-
- Published online by Cambridge University Press:
- 23 February 2012, pp. 343-354
-
- Article
- Export citation
- Cited by 1
Construction of Very Hard Functions for Multiparty Communication Complexity
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 61-75
-
- Article
- Export citation
- Cited by 1
Languages of finite words occurring infinitely many times in an infinite word
-
- Published online by Cambridge University Press:
- 15 October 2005, pp. 641-650
-
- Article
- Export citation
- Cited by 1
A bound for the ω-equivalence problem of polynomial D0L systems
-
- Published online by Cambridge University Press:
- 15 November 2003, pp. 149-157
-
- Article
- Export citation
- Cited by 1
The theorem of Fine and Wilf for relational periods
-
- Published online by Cambridge University Press:
- 05 June 2008, pp. 209-220
-
- Article
- Export citation
- Cited by 1
Increasing integer sequences and Goldbach's conjecture
-
- Published online by Cambridge University Press:
- 20 July 2006, pp. 107-121
-
- Article
- Export citation
- Cited by 1
Dynamic overloading with copy semantics in object-oriented languages: a formal account
-
- Published online by Cambridge University Press:
- 12 March 2009, pp. 517-565
-
- Article
- Export citation
- Cited by 1
Quantum coherent spaces and linear logic
-
- Published online by Cambridge University Press:
- 28 October 2010, pp. 419-441
-
- Article
- Export citation
- Cited by 1
Towards parametrizing word equations
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 331-350
-
- Article
- Export citation