1962
- [1]
- Marcel-Paul
Schützenberger.
Finite counting automata.
Information and Control, 5:91–107, 1962.
- [2]
- Marcel-Paul
Schützenberger.
Certain infinite formal products
and their combinatorial applications.
In Colloquium Comb. Methods Probab. Theory, pages 58–63. Aarhus,
1962.
- [3]
- Marcel-Paul
Schützenberger.
On a theorem of R. Jungen.
Proc. Amer. Math. Soc., 13:885–890, 1962.
- [4]
- Murray Eden and
Marcel-Paul Schützenberger.
Remark on a theorem of Dénes.
Magyar Tud. Akad. Mat. Kutató Int. Közl., 7:353–355, 1962.
- [5]
- Roger C. Lyndon and
Marcel-Paul Schützenberger.
The equation
am=bncp in a free group.
Michigan Math. J., 9:289–298, 1962.
- [6]
- Marcel-Paul
Schützenberger.
On probabilistic push-down
storages.
In Self-Organizing Systems, Proceedings, pages 205–213. Spartan
Books, Washington, 1962.
- [7]
- Marcel-Paul
Schützenberger.
On an abstract machine property
preserved under the satisfaction relation.
Technical Report NC-167, IBM Thomas Watson Research Center, 1962.
- [8]
- Marcel-Paul
Schützenberger.
On the minimum number of elements in a cutting
set of words.
Technical Report NC-173, IBM Thomas Watson Research Center, 1962.
- [9]
- Marcel-Paul
Schützenberger.
On a family of formal power
series.
11 pages, manuscrit, mars 1962.