Y. Breitbart

Automaticity: Properties of a Measure of Descriptional Complexity

Jeffrey Shallit, Yuri Breitbart, J. Shallit, 1994, STACS.

Automaticity I: Properties of a Measure of Descriptional Complexity

Jeffrey Shallit, Yuri Breitbart, J. Shallit, 1996, J. Comput. Syst. Sci..

Subclasses of Turing machines reducible to finite automata

V. A. Kozmidiadi, Y. Breitbart, 1972 .

Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions

Yuri Breitbart, Shmuel Gal, S. Gal, 1978, IEEE Transactions on Computers.

Optimal sequential arrangement of evaluation trees for boolean functions

Yehoshua Perl, Yuri Breitbart, Y. Perl, 1976, Inf. Sci..

On the Size of Binary Decision Diagrams Representing Boolean Functions

Harry B. Hunt, Daniel J. Rosenkrantz, Yuri Breitbart, 1995, Theor. Comput. Sci..