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 8
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 29-42
-
- Article
- Export citation
- Cited by 8
Unambiguous erasing morphisms in free monoids
-
- Published online by Cambridge University Press:
- 07 December 2009, pp. 193-208
-
- Article
- Export citation
- Cited by 8
Reaction automata working in sequential manner∗∗∗
-
- Published online by Cambridge University Press:
- 21 January 2014, pp. 23-38
-
- Article
- Export citation
- Cited by 8
Generalizations of Parikh mappings
-
- Published online by Cambridge University Press:
- 16 December 2009, pp. 209-228
-
- Article
- Export citation
- Cited by 8
Rational base number systems for p-adic numbers
-
- Published online by Cambridge University Press:
- 22 August 2011, pp. 87-106
-
- Article
- Export citation
- Cited by 8
A hierarchy for circular codes
-
- Published online by Cambridge University Press:
- 22 January 2008, pp. 717-728
-
- Article
- Export citation
- Cited by 8
Monotone (co)inductive types and positive fixed-point types
-
- Published online by Cambridge University Press:
- 15 August 2002, pp. 309-328
-
- Article
- Export citation
- Cited by 8
Idealized coinductive type systems for imperative object-oriented programs
-
- Published online by Cambridge University Press:
- 15 March 2011, pp. 3-33
-
- Article
- Export citation
- Cited by 7
An abstract monadic semantics for value recursion
-
- Published online by Cambridge University Press:
- 15 October 2004, pp. 375-400
-
- Article
- Export citation
- Cited by 7
Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
-
- Published online by Cambridge University Press:
- 20 July 2010, pp. 313-337
-
- Article
- Export citation
- Cited by 7
About the decision of reachability for register machines
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 341-358
-
- Article
- Export citation
- Cited by 7
On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes
-
- Published online by Cambridge University Press:
- 15 November 2003, pp. 255-270
-
- Article
- Export citation
- Cited by 7
A Lower Bound For Reversible Automata
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 331-341
-
- Article
- Export citation
- Cited by 7
A note on the Size-Ramsey number of long subdivisions of graphs
-
- Published online by Cambridge University Press:
- 15 March 2005, pp. 191-206
-
- Article
- Export citation
- Cited by 7
Number-Conserving Reversible Cellular Automata and Their Computation-Universality
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 239-258
-
- Article
- Export citation
- Cited by 7
Cutwidth of the r-dimensional Mesh of d-ary Trees
-
- Published online by Cambridge University Press:
- 15 April 2002, pp. 515-519
-
- Article
- Export citation
- Cited by 7
On Shuffle Ideals
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 359-384
-
- Article
- Export citation
- Cited by 7
On the Topological Complexity of Infinitary Rational Relations
-
- Published online by Cambridge University Press:
- 15 November 2003, pp. 105-113
-
- Article
- Export citation
- Cited by 7
Efficiency of automata in semi-commutation verification techniques
-
- Published online by Cambridge University Press:
- 25 September 2007, pp. 197-215
-
- Article
- Export citation
- Cited by 7
Similarity relations and cover automata
-
- Published online by Cambridge University Press:
- 15 March 2005, pp. 115-123
-
- Article
- Export citation