Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science

On the definition of a family of automata

M. P. Schützenberger · Information and Control · 1961 · 636 citations

Logical Automaton, Engineering, Automated Reasoning +4

The boundedness of all products of a pair of matrices is undecidable

Vincent D. Blondel, John N. Tsitsiklis · Systems & Control Letters · 2000 · 216 citations

Rational series and their languages

Choice Reviews Online · 1989 · 190 citations

Rational Series, Rational Approximation, Analytic Number Theory

Factorization forests of finite height

Imre Simon · Theoretical Computer Science · 1990 · 124 citations

Geometric Modeling, Forest Inventory, Forest Biometrics +6

Learning functions represented as multiplicity automata

Amos Beimel, Francesco Bergadano, Nader H. Bshouty et al. · Journal of the ACM · 2000 · 121 citations · Full text

Minimal Multiplicity Automaton, Computational Complexity Theory, Engineering +14