Volume 23, Number 1, January 2012
: Ordinal Automata and Cantor Normal Form.
, Bianca Truthe
: A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems: Part I.
Volume 23, Number 2, February 2012
: Constant-Memory Iterative Generation of Special Strings Representing Binary Trees.
Volume 23, Number 3, April 2012
Volume 23, Number 4, June 2012 Special Issue - Advances in Parallel and Distributed Computational Models
, Pradip K. Srimani
: Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size.
: Performance Analysis and Evaluation of Random Walk Algorithms on Wireless Networks.
Volume 23, Number 5, August 2012 Special Issue - Developments in Language Theory (DLT 2011)
Volume 23, Number 6, September 2012 Special Issue - Automata and Formal Languages (AFL 2011)
: Probing High-Capacity Peers to Reduce Download times in P2P File Sharing Systems with Stochastic Service Capacities.
: Testing for forbidden Posets in Ordered Rooted Forests.
Volume 23, Number 7, November 2012 Special Issue - The Frontier Between Decidability and Undecidability and Related Problems
: Decidability and Universality in the Axiomatic Theory of Computability and Algorithms.
: Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language.
: Some Initial Thoughts on Bounded Query Computations over the Reals.
Volume 23, Number 8, December 2012 Special Issue - WORDS 2011
: Substitutions over Infinite Alphabet Generating (-β)-Integers.
: Permutation Complexity and the Letter Doubling Map.