From Surf Wiki (app.surf) — the open knowledge base
Journal of Automata, Languages and Combinatorics
| Field | Value |
|---|---|
| title | Journal of Automata, Languages and Combinatorics |
| cover | Jalc.jpg |
| image_size | 200px |
| discipline | Computer science |
| formernames | Journal of Information Processing and Cybernetics; Elektronische Informationsverarbeitung und Kybernetik |
| abbreviation | J. Autom. Lang. Comb. |
| publisher | Justus-Liebig Universität, Institut für Informatik, Giessen |
| country | Germany |
| frequency | Quarterly |
| history | 1965–present |
| website | http://www.jalc.de |
| ISSN | 1430-189X |
| OCLC | 474943262 |
| link1-name = | impact-year = The Journal of Automata, Languages and Combinatorics (JALC) is a peer-reviewed scientific journal of computer science. It was established in 1965 as the Journal 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 on automata theory, formal language theory, and combinatorics.
The editor-in-chief of the journal was, until 2015, Jürgen Dassow of the Otto von Guericke University of Magdeburg. From 2016, the editors in chief are Markus Holzer and Martin Kutrib, and the publication is handled by the Institute of Informatics at the University of Giessen.
Bibliographic databases indexing the journal include the ACM Guide to Computing Literature, the Digital Bibliography & Library Project, the MathSciNet database, and the Zentralblatt MATH.
Most cited articles
According to Google Scholar, the following articles have been cited most often (≥ 100 times):
- Mehryar Mohri. Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 7(3):321–350 (2002)
- Rolf Wiehagen. Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Elektronische Informationsverarbeitung und Kybernetik 12(1/2):93–99 (1976)
- Gheorghe Păun. Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics 1(1):27–36 (1996)
References
References
- [http://portal.acm.org/toc.cfm?id=J403 Information at the ACM Guide to Computing Literature]
- [http://www.informatik.uni-trier.de/~ley/db/journals/jalc/ Information at DBLP]
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Journal of Automata, Languages and Combinatorics — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report