Andrzej Ehrenfeucht

• A. Ehrenfeucht and G. Rozenberg. The number of occurrences of letters versus their distribution in some E0L languages. Information and Control, 26(3):256-271, November 1974. Citations.

• A. Ehrenfeucht and G. Rozenberg. Simplifications of homomorphisms. Information and Control, 38(3):298-309, September 1978. Citations.

• A. Ehrenfeucht, H. Maurer, and G. Rozenberg. Continuous grammars. Information and Control, 46(1):71-91, July 1980.

• A. Ehrenfeucht and G. Rozenberg. On basic properties of DOS systems and languages. Information and Control, 47(2):137-153, November 1980. Citations.

• A. Ehrenfeucht and G. Rozenberg. Repetition of subwords in DOL languages. Information and Control, 59(1-3):13-35, October/November/December 1983. References.

• Andrzej Ehrenfeucht and Grzegorz Rozenberg. An easy proof of Greibach normal form. Information and Control, 63(3):190-199, December 1984. Citations.

• Andrzej Ehrenfeucht and David Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231-246, September 1989. References and Citations.

• Andrzej Ehrenfeucht, David Haussler, Michael Kearns, and Leslie Valiant. A general lower bound on the number of examples needed for learning. Information and Computation, 82(3):247-261, September 1989. Citations.

• A. Ehrenfeucht, H. J. Hoogeboom, and G. Rozenberg. Combinatorial properties of dependence graphs. Information and Computation, 114(2):315-328, 1 November 1994.

Shortcuts: