| 翻訳と辞書 |
| Journal of Automata, Languages and Combinatorics ： ウィキペディア英語版 |
Journal of Automata, Languages and Combinatorics
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〔(Iinformation at the ACM Guide to Computing Literature )〕 and the Digital Bibliography & Library Project.〔(Information at DBLP )〕
== 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)
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Journal of Automata, Languages and Combinatorics」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|