Linear Probabilistic Sequential Machines - Robert Knast (Inf. Control., 1969)

Continuous-Time Probabilistic Automata - Robert Knast (Inf. Control., 1969)

Representability of Nonregular Languages in Finite Probabilistic Automata - Robert Knast (Inf. Control., 1970)

Finite-State Probabilistic Languages - Robert Knast (Inf. Control., 1972)

Semigroup Characterizations of Some Language Varieties. - Robert Knast (MFCS, 1976)

Reading Functions and an Extension of Kleene Theorem for some Families of Languages. - Robert Knast; Jacek Martinek (FCT, 1977)

The Dot-Depth Hierarchy of Star-Free Languages is Infinite. - Janusz A. Brzozowski; Robert Knast (J. Comput. Syst. Sci., 1978)

A Semigroup Characterization of Dot-Depth one Languages. - Robert Knast (RAIRO Theor. Informatics Appl., 1983)

Some Theorems on Graph Congruences. - Robert Knast (RAIRO Theor. Informatics Appl., 1983)

Propositional calculi of term satisfiability and process logics. - Robert Knast (Symposium on Computation Theory, 1984)

Graph Congruences and Pair Testing. - Janusz A. Brzozowski; Robert Knast (RAIRO Theor. Informatics Appl., 1986)