Journal of Automata, Languages and Combinatorics

The Journal of Automata, Languages and Combinatorics is a peer-reviewed scientific journal established in 1965 as the Journal of Information Processing and Cybernetics (Elektronische Informationsverarbeitung und Kybernetik). It obtained its current title in 1996 with volume numbering reset to 1. As of May 2012, the editor-in-chief is Jurgen Dassow (Otto-von-Guericke-Universität Magdeburg).

The main focus of this journal is on a subfield of theoretical computer science, particularly automata theory, formal language theory, and combinatorics. Particular attention is given to: grammatical methods for generation of 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.); automata as acceptors of languages of words, graphs, etc.; decision problems; efficient algorithms for solving problems concerning languages, grammars and automata; algebraic properties of automata and languages; combinatorial properties of words, sequences of words, sets of words, etc.; codes as languages; 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.; combinatorics, graph theory, discrete mathematics in relation with problems of theoretical computer science.

Three articles of this journal have been cited more than 100 times ;Mehryar Mohri. “Semiring frameworks and algorithms for shortest-distance problems.” (2002); Rolf Wiehagen. “Limes-Erkennung rekursiver Funktionen durch spezielle Strategien.” (1976); and Gheorghe Păun. “Regular extended H systems are computationally universal.” (1996).

Image Caption: Journal of Automata, Languages and Combinatorics, Volume 12, Issue 4 cover. Credit: Wikipedia

For more information see: