Research Article
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
Introduction
Preface
-
- Published online by Cambridge University Press:
- 15 June 2007, p. VII
-
- Article
- Export citation
Research Article
A Note on a Conjecture of Duval and Sturmian Words
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 1-3
-
- Article
- Export citation
An Upper Bound on the Space Complexity of Random Formulae in Resolution
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 329-339
-
- Article
- Export citation
Words over an ordered alphabet and suffix permutations
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 249-259
-
- Article
- Export citation
About the decision of reachability for register machines
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 341-358
-
- Article
- Export citation
A Fully Equational Proof of Parikh's Theorem
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 129-153
-
- Article
- Export citation
Polypodic codes
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 5-28
-
- Article
- Export citation
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 29-42
-
- Article
- Export citation
On Shuffle Ideals
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 359-384
-
- Article
- Export citation
Permissive strategies: from parity games to safety games
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 261-275
-
- Article
- Export citation
Semantics of value recursion for Monadic Input/Output
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 155-180
-
- Article
- Export citation
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 277-291
-
- Article
- Export citation
Pipelined Decomposable BSP Computers
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 43-65
-
- Article
- Export citation
On a characteristic property of ARNOUX–RAUZY sequences
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 385-388
-
- Article
- Export citation
Feedback, trace and fixed-point semantics
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 181-194
-
- Article
- Export citation
On multiplicatively dependent linear numeration systems, and periodic points
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 293-314
-
- Article
- Export citation
On the distribution of characteristic parameters of words
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 67-96
-
- Article
- Export citation
μ-Bicomplete Categories and Parity Games
-
- Published online by Cambridge University Press:
- 15 December 2002, pp. 195-227
-
- Article
- Export citation
Integer Partitions, Tilings of 2D-gons and Lattices
-
- Published online by Cambridge University Press:
- 15 February 2003, pp. 389-399
-
- Article
- Export citation