Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Journal of Automata, Languages and Combinatorics

From Wikipedia, the free encyclopedia
Academic journal
Journal of Automata, Languages and Combinatorics
DisciplineComputer science
LanguageEnglish
Publication details
Former names
Journal of Information Processing and Cybernetics; Elektronische Informationsverarbeitung und Kybernetik
History1965–present
Publisher
Justus-Liebig Universität, Institut für Informatik, Giessen (Germany)
FrequencyQuarterly
Standard abbreviations
ISO 4 (alt· Bluebook (alt)
NLM (alt· MathSciNet (altPaid subscription required)
ISO 4J. Autom. Lang. Comb.
Indexing
CODEN (alt · alt2· JSTOR (alt· LCCN (alt)
MIAR · NLM (alt· Scopus · W&L
ISSN1430-189X
OCLC no.474943262
Links

TheJournal of Automata, Languages and Combinatorics (JALC) is apeer-reviewedscientific journal ofcomputer science. It was established in 1965 as theJournal of Information Processing and Cybernetics (German:Elektronische Informationsverarbeitung und Kybernetik) and obtained its current title in 1996 with volume numbering reset to 1. The main focus of the journal is onautomata theory,formal language theory, andcombinatorics.

The editor-in-chief of the journal was, until 2015,Jürgen Dassow of theOtto von Guericke University of Magdeburg. From 2016, the editors in chief areMarkus Holzer andMartin Kutrib, and the publication is handled by the Institute of Informatics at theUniversity of Giessen.

Bibliographic databases indexing the journal include theACM Guide to Computing Literature,[1] theDigital Bibliography & Library Project,[2] theMathSciNet database, and theZentralblatt MATH.

Most cited articles

[edit]

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

  1. Mehryar Mohri. Semiring frameworks and algorithms forshortest-distance problems. Journal of Automata, Languages and Combinatorics7(3):321–350 (2002)
  2. Rolf Wiehagen. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien.Elektronische Informationsverarbeitung und Kybernetik12(1/2):93–99 (1976)
  3. Gheorghe Păun. Regular extended H systems are computationally universal.Journal of Automata, Languages and Combinatorics1(1):27–36 (1996)

References

[edit]
  1. ^Information at the ACM Guide to Computing Literature
  2. ^Information at DBLP

External links

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Journal_of_Automata,_Languages_and_Combinatorics&oldid=1283579723"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp