Journal of Automata, Languages and Combinatorics

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 ==