Jump to content

Janusz Brzozowski (computer scientist)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hermel (talk | contribs) at 11:26, 14 July 2009 (created page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Janusz (John) Antoni Brzozowski (born on May 10, 1935 in Warsaw, Poland) is a Polish-Canadian computer scientist.

In 1962, Brzwozowski earned his PhD in the field of electrical engineering at Princeton University. From 1967 to 1996 he was Professor at the University of Waterloo. He is best known for his contributions to mathematical logic, circuit theory and automata theory. In particular, he is known for his theoretical work on regular expressions and for proving together with R. Knast that the dot-depth hierarchy is infinite, a problem in mathematical logic which was open for ten years.

Influential research papers

  • J. A. Brzozowski: Derivatives of regular expressions, Journal of the ACM 11(4): 481-494 (1964)
  • J. A. Brzozowski, I. Simon: Characterizations of Locally Testable Events, FOCS 1971, pp. 166-176
  • J. A. Brzozowski, R. Knast: The Dot-Depth Hierarchy of Star-Free Languages is Infinite. Journal of Computer and System Sciences 16(1): 37-55 (1978)

Books

  • J. A. Brzozowski, M. Yoeli: Digital Networks. Prentice-Hall, 1976
  • J.A. Brzozowski, C.-J. H. Seger: Asychronous Circuits. Springer-Verlag, 1995
Retrieved from "https://en.wikipedia.org/w/index.php?title=Janusz_Brzozowski_(computer_scientist)&oldid=302027761"