Journal of Automata, Languages and Combinatorics

Journal of Automata, Languages and Combinatorics  
Former names
 Journal of Information Processing and Cybernetics/Elektronische Informationsverarbeitung und Kybernetik
Discipline Computer science
Language English
Publication details
Publisher
Publication history
 1965-present
Frequency Quarterly
Indexing
ISSN 1430-189X
OCLC no. 474943262
Links

The Journal of Automata, Languages and Combinatorics is a peer-reviewed scientific journal of computer science, 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 reset to 1. The main focus of the journal is on automata theory, formal language theory, and combinatorics.

Bibliographic databases indexing the journal include the ACM Guide to Computing Literature[1] and the Digital Bibliography & Library Project.[2]

Most cited articles

According to Google Scholar, the following articles have been cited most often (≥ 100 times):

  1. Mehryar Mohri. 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)

References

  1. ↑ Information at the ACM Guide to Computing Literature
  2. ↑ Information at DBLP
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.