Le prince Otto, fils aîné de l'ex-empereur [Charles] d'Autriche : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 58306

Les enfants de l'empereur [Charles] d'Autriche, le prince Otto et sa petite soeur la princesse Adélaïde : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 58308

L'empereur Charles d'Autriche, [son épouse Zita] et ses enfants [Félix, Robert, Otto et Adélaïde, reproduction d'une photographie] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 58305

[Otto Karl] Gessler, ministre allemand : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 58696

Proceedings : Grand Lodge, A.F. & A.M. of Canada in the Province of Ontario - 1912

On spine : The Grand Lodge of Canada in the Province of Ontario.

Ms.Ff.F.Stoltze 3. 137 - Brief von Otto Hörth an Lyda Stoltze

Stoltze

Michigan University Regents 75th Anniversary Celebration, June 27, 1912

On verso: Standing L-R: Frank B. Leland, John H. Grant, Secretary Shirley W. Smith, Harry O. Bulkey, William L. Clements, Lucius L. Hubbard, Benjamin Hanchett, Junius E. Beal, Seated L-R: Luther L. Wright, Pres. Emeritus James B. Angell, Pres. Harry B. Hutchins, Walter M. Sawyer

CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store

We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.

On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One

It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems.