Theoretical Computer Science
Its contents are mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All kinds of papers, introducing or studying mathematical, logical and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing. Papers published in Theoretical Computer Science are grouped in two sections according to their nature. One section, "Algorithms, automata, complexity and games", is devoted to the study of algorithms and their complexity using analytical, combinatorial or probabilistic methods. It includes the whole fields of abstract complexity (i.e., all the results about the hierarchies that can be defined using Turing machines), of automata and language theory (including automata on infinite words and infinitary languages), of geometrical (graphic) applications and of system performance using statistical models. A subsection is the Mathematical Games Section, which is devoted to the mathematical and computational analysis of games.
The other section, "Logic, semantics and theory of programming", is devoted to formal methods to check properties of programs of implement formally described languages; it contains all papers dealing with semantics of sequential and parallel programming languages. All formal methods treating these problems are published in this section, including rewriting techniques, abstract data types, automatic theorem proving, calculi such as SCP or CCS, Petri nets, new logic calculi and developments in categorical methods.
Prof. Giorgio Ausiello,
Dipartemento di Infermatica e Sistemistica,
Università di Roma "La Sapienza",
Via Salaria 113,
Fax: +39 06 85300849
Prof. Don Sannella,
School of Informatics,
James Clerk Maxwell Building,
King's Buildings, Mayfield Road,
Edinburgh EH9 3JZ,
Fax: +44 131 667 7209