CAI 2013

5th International Conference on Algebraic Informatics



logo AMU
Marcella Anselmo, Dora Giammarresi, Maria Madonia
Strong prefix codes of pictures.

Yves Aubry, Philippe Langevin
On a Conjecture of Helleseth.

Stéphane Ballet, Jean Chaumine, Julia Pieltant
Shimura modular curves and asymptotic symmetric tensor rank of multiplication in any finite field.

Symeon Bozapalidis, George Rahonis
Stochastic equationality.

Michael Cadilhac, Andreas Krebs, Pierre McKenzie
The algebraic theory of Parikh automata.

Marco Calderini, Massimiliano Sala
Generalized AG codes as evaluation codes.

Bruno Courcelle, Irène Durand
Model-checking by infinite fly-automata.

Konstantinos Draziotis, Dimitrios Poulakis
Lattice attacks on DSA schemes based on Lagrange's algorithm.

Gérard H.E. Duchamp , Nguyen Hoang-Nghia, Adrian Tanasa
A selection-quotient process for packed word Hopf algebra.

Nadia El Mrabet
Side channel attacks against pairing over theta functions.

Georgios Fotiadis, Elisavet Konstantinou
On the efficient generation of generalized MNT elliptic curves.

Johan P. Hansen
Osculating spaces of varieties and linear network codes.

Sebastian Junges, Ulrich Loup, Florian Corzilius, Erika Ábrahám
On Gröbner bases in the context of satisfiability-modulo-theories solving over the real numbers.

Andreas Maletti
Synchronous forest substitution grammars

Eleni Mandrali, George Rahonis
Characterizations of weighted first-order logics over semirings.

Victor Marsault, Jacques Sakarovitch
On sets of numbers rationally represented in a rational base number system.

Matteo Piva, Massimiliano Sala
A new bound for cyclic codes beating the Roos bound.

Laurent Poinsot
Linear induction algebra and a normal form for linear operators.

Michel de Rougemont, Mathieu Tracol
Approximation of large probabilistic networks by structured population protocols.



5th International Conference on Algebraic Informatics (CAI 2013)
September 3 - 6, 2013
Porquerolles Island
Aix-Marseille University, France

CAI 2013 will include a highly selective single-track program for papers describing original and unpublished research advancing the state of the art in the field.

Authors  are invited to submit papers (in PDF format) presenting original research work, electronically to

(You should receive an acknowledgment within 3 days)

All submissions should be formatted according to the usual LNCS article style:

and should not exceed 12 pages.
If the authors believe that more details are essential to substantiate the main claims, they may include a clearly marked appendix that will be read at the discretion of the program committee.

Simultaneous submission to other conferences with published proceedings is not allowed.

The deadline is extended. The new important dates are:

Submission Due:

before 25th of March 2013


9 May 2013

Proceedings Version Due: 28 May 2013


The Proceedings of CAI 2013 will be published in the Lecture Notes in Computer Science Series (LNCS) by Springer.

Authors of accepted papers will be invited to provide a final version of their paper formatted with the llncs.cls class file (


(including but not limited to the following topics of interest)

algebraic specifications and algorithms
algebraic coding theory
algebraic aspects of cryptography
computational number theory
formal power series
algebraic semantics
finite and infinite computations
algebraic characterization of logical theories
process algebra
program construction and refinements
acceptors and transducers for discrete structures
decision problems
term rewriting
abstract machines or systems
hybrid automata composition

Papers describing original R&D solutions in the field are also welcome.
© 2012-2013 IML-CNRS - updated: may 15, 2013