Janusz Brzozowski (computer scientist)

Janusz Brzozowski
Born (1935-05-10) May 10, 1935
Warsaw, Poland
Fields Computer science
Alma mater Princeton University
Thesis Regular Expression Techniques for Sequential Circuits (1962)
Doctoral advisor Edward J. McCluskey
Known for Brzozowski derivative

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

In 1962, Brzozowski earned his PhD in the field of electrical engineering at Princeton University under Edward J. McCluskey. The topic of the thesis was Regular Expression Techniques for Sequential Circuits. From 1967 to 1996 he was Professor at the University of Waterloo. He is known for his contributions to mathematical logic, circuit theory, and automata theory.

Achievements in research

Brzozowski worked on regular expressions and on syntactic semigroups of formal languages.[1] The result was Characterizations of locally testable events written together with Imre Simon, which had a similar impact[2] on the development of the algebraic theory of formal languages as Marcel-Paul Schützenberger's characterization of the star-free languages.

In the area, there are today at least three concepts bearing Brzozowski's name in honour of his contributions: The first is the Brzozowski conjecture[3] about the regularity of noncounting classes. Second, Brzozowski's algorithm [4] is a conceptually simple algorithm for performing DFA minimization. Third, Eilenberg's reference work on automata theory has a chapter devoted to the so-called Brzozowski hierarchy[5] inside the star-free languages, also known as dot-depth hierarchy. Curiously, Brzozowski was not only co-author of the paper[6] that defined the dot-depth hierarchy and raised the question whether this hierarchy is strict, he later also was co-author of the paper[7] resolving that problem after roughly ten years. The Brzozowski hierarchy gained further importance after Thomas discovered a relation between the algebraic concept of dot-depth and the alternation depth of quantifiers in first-order logic via Ehrenfeucht-Fraïssé games.[8]

He received the following academic awards:

Research papers

Books

Notes

  1. Pin (1997)
  2. Diekert et al. (2008)
  3. de Luca and Varicchio (1997)
  4. Shallit (2009), ch. 3.10
  5. Eilenberg (1974)
  6. Cohen and Brzozowski (1971)
  7. Brzozowski and Knast (1979)
  8. Thomas (1982)
  9. Profile of John Brzozowski
  10. Pioneers of Computing in Canada

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.