Information and Computation, Volume 206
Volume 206, Number 1, January 2008
: Baire categories on small complexity classes and meager-comeager laws.
Volume 206, Numbers 2-4, February-April 2008
Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA '06)
: Preservation of probabilistic information flow under refinement.
Volume 206, Number 5, May 2008
The 17th International Conference on Concurrency Theory (CONCUR 2006)
Special Issue Articles
Regular Issue Articles
: Trees with exponentially growing costs.
Volume 206, Number 6, June 2008
Volume 206, Number 7, July 2008
Shih Ping Tung
: Computational complexity of sentences over fields.
Volume 206, Number 8, August 2008
: Comparing communication primitives via their relative expressive power.
Volume 206, Numbers 9-10, September - October 2008
: Soliton automata with constant external edges.
: Compositions of extended top-down tree transducers.
Pavel V. Martugin
: A series of slowly synchronizing automata with a zero state over a small alphabet.
: Slender Siromoney matrix languages.
Volume 206, Number 11, November 2008
: Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm.
: Optimal vertex ranking of block graphs.
Volume 206, Number 12, December 2008
: On a definition of random sequences with respect to conditional probability.
: Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations.