Aims and Scope

The Journal of Automata, Languages and Combinatorics is a forum for research in all areas of the field, from theory to applications and relations to other subjects. Particular attention is given to

• automata as acceptors or transducers of languages of words, graphs, etc.;
• weighted automata;
• efficient algorithms for solving problems concerning languages, grammars and automata;
• decision problems;
• algebraic properties of automata and languages; combinatorial properties of words, sequences of words, sets of words, etc.;
• grammatical methods for generating sets of words, graphs, arrays, pictures, higher dimensional and infinite objects, etc. (including the classical grammars of the Chomsky hierarchy, Lindenmayer systems and their variations, graph grammars, etc.);
• descriptional complexity of grammars, automata, etc.;
• codes as languages and estimations of parameters of codes;
• relations of languages and automata to complexity theory, logics, etc.;
• trace languages; Petri net languages;
• formal models for concurrent processes;
• applications of formal languages and automata to programming languages, natural languages, biology, etc.;
• non-classical models and computations;
• combinatorics, graph theory, discrete mathematics in relation with problems of theoretical computer science.

The Journal of Automata, Languages and Combinatorics publishes original articles. Occasionally, special issues will be published dedicated to a particular topic or with selected and extended papers of conferences.