The Journal of Automata, Languages and Combinatorics is a peer-reviewed

Peer review

Peer review is a process of self-regulation by a profession or a process of evaluation involving qualified individuals within the relevant field. Peer review methods are employed to maintain standards, improve performance and provide credibility...

 scientific journal

Scientific journal

In academic publishing, a scientific journal is a periodical publication intended to further the progress of science, usually by reporting new research. There are thousands of scientific journals in publication, and many more have been published at various points in the past...

 of computer science

Computer science

Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...

, edited by Jürgen Dassow. It was established in 1965 as the Journal of Information Processing and Cybernetics/Elektronische Informationsverarbeitung und Kybernetik and obtained its current title in 1996 with volume numbering rest to 1. The main focus of the journal is on a subfield of theoretical computer science

Theoretical computer science

Theoretical computer science is a division or subset of general computer science and mathematics which focuses on more abstract or mathematical aspects of computing....

, namely on automata theory

Automata theory

In theoretical computer science, automata theory is the study of abstract machines and the computational problems that can be solved using these machines. These abstract machines are called automata...

, formal language

Formal language

A formal language is a set of words—that is, finite strings of letters, symbols, or tokens that are defined in the language. The set from which these letters are taken is the alphabet over which the language is defined. A formal language is often defined by means of a formal grammar...

 theory, and combinatorics

Combinatorics

Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size , deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria ,...

.

Bibliographic databases indexing the journal include the ACM Guide to Computing Literature

ACM Guide to Computing Literature

ACM Guide to Computing Literature is a database, published by the Association for Computing Machinery , that categorizes and abstracts most computer science literature. It contains citations to all ACM publications, as well as literature from other publishers.The Guide was also published in print...

 and the Digital Bibliography & Library Project

Digital Bibliography & Library Project

DBLP is a computer science bibliography website hosted at Universität Trier, in Germany. It was originally a database and logic programming bibliography site, and has existed at least since the 1980s. DBLP listed more than 1.3 million articles on computer science in January 2010...

.

Most cited articles

According to Google Scholar

Google Scholar

Google Scholar is a freely accessible web search engine that indexes the full text of scholarly literature across an array of publishing formats and disciplines. Released in beta in November 2004, the Google Scholar index includes most peer-reviewed online journals of Europe and America's largest...

, the following articles have been cited most often (≥ 100 times):

1. Mehryar Mohri
   Mehryar Mohri
   Mehryar Mohri is a professor of computer science at the Courant Institute of Mathematical Sciences at New York University known for his work in machine learning, automata theory and algorithms, speech recognition and natural language processing....
   
   . Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 7(3):321–350 (2002)
2. Rolf Wiehagen. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12(1/2):93–99 (1976)
3. Gheorghe Păun. Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics 1(1):27–36 (1996)