Janusz Brzozowski (computer scientist)

Janusz (John) Antoni Brzozowski (May 10, 1935 - October 24, 2019) was a Polish-Canadian computer scientist and Distinguished Professor Emeritus[1] at the University of Waterloo's David R. Cheriton School of Computer Science.[2]

Janusz Brzozowski
Brzozowski in 2018
Born(1935-05-10)May 10, 1935
Warsaw, Poland
DiedOctober 24, 2019(2019-10-24) (aged 84)
Lisaard House, Cambridge, Ontario, Canada
Alma materPrinceton University
Known forBrzozowski derivative
Scientific career
FieldsComputer science
ThesisRegular Expression Techniques for Sequential Circuits (1962)
Doctoral advisorEdward J. McCluskey

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.[3] The result was Characterizations of locally testable events written together with Imre Simon, which had a similar impact[4] 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, today at least three concepts bear Brzozowski's name in honour of his contributions: The first is the Brzozowski conjecture[5] about the regularity of noncounting classes. Second, Brzozowski's algorithm[6] 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[7] inside the star-free languages, also known as dot-depth hierarchy. Curiously, Brzozowski was not only co-author of the paper that defined the dot-depth hierarchy and raised the question whether this hierarchy is strict,[8] he later also was co-author of the paper resolving that problem after roughly ten years.[9] 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.[10]

He has received the following academic awards and honours:

  • NSERC Scientific Exchange Award to France (1974–1975)
  • Japan Society for the Promotion of Science Research Fellowship (1984)
  • Computing Research Association Certificate of Appreciation for outstanding contributions and service as a member of the CRA Board of Directors (1992)
  • Distinguished Professor Emeritus, University of Waterloo, Canada (1996)[11]
  • Medal of Merit, Catholic University of Lublin, Poland (2001)
  • IBM Canada Canadian Pioneer in Computing (2005)[12]
  • The Role of Theory in Computer Science, a one-day conference in honour of John Brzozowski's 80th birthday (2015)[13]
  • Lifetime Achievement Award, Computer Science Canada/Informatique Canada (CS-CAN/INFO-CAN) (2016)[14]
  • CIAA 2017 Sheng Yu Award for Best Paper for Complexity of Proper Prefix-Convex Regular Languages by J. Brzozowski and C. Sinnamon[15]
  • CIAA 2018 Sheng Yu Award for Best Paper for State Complexity of Overlap Assembly by J. Brzozowski, L. Kari, B. Li, M. Szykula[16]

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
  • R. S. Cohen, J. A. Brzozowski: Dot-Depth of Star-Free Events. Journal of Computer and System Sciences 5(1): 1-16 (1971)
  • 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: Asynchronous Circuits. Springer-Verlag, 1995

Notes
  1. "John Brzozowski". David R. Cheriton School of Computer Science. Retrieved December 21, 2018.
  2. https://www.legacy.com/obituaries/theglobeandmail/obituary.aspx?n=janusz-a-brzozowski&pid=194286993&fhid=30885
  3. Pin (1997)
  4. Diekert et al. (2008)
  5. de Luca and Varicchio (1997)
  6. Shallit (2009), ch. 3.10
  7. Eilenberg (1974)
  8. Cohen and Brzozowski (1971)
  9. Brzozowski and Knast (1979)
  10. Thomas (1982)
  11. Profile of John Brzozowski
  12. Pioneers of Computing in Canada, 2005, http://individual.utoronto.ca/klyons/files/pioneers.pdf Retrieved January 2, 2019.
  13. "Brzozowski 80: The Role of Theory in Computer Science". David R. Cheriton School of Computer Science. June 24, 2015. Retrieved December 21, 2018.
  14. "Lifetime Achievement Awards | 2016". Computer Science Canada/Information Canada (CS-CAN/ INFO-CAN). 2016. Retrieved December 21, 2018.
  15. "22nd International Conference Implementation and Application of Automata | 2017 Sheng Yu Award". Conference on Implementation and Application of Automata (CIAA 2017). 2017. Retrieved December 21, 2018.
  16. "23rd International Conference on Implementation and Applications of Automata | 2018 Sheng Yu Award". 23rd International Conference on Implementation and Applications of Automata (CIAA 2018). August 23, 2018. Retrieved December 21, 2018.
gollark: But why?
gollark: It's also very hard to patch over all the possible ways to regain access to the old `fs` API, like `getfenv`, `debug`, and sometimes `load`.
gollark: It's quite difficult and complex, and if you do it people may complain that your OS is a virus.
gollark: I mean, `test` is no longer a directory - because it doesn't exist - but your working directory is that.
gollark: I don't see why that's unxpected?

References
  • S. Eilenberg, Automata, Languages and Machines, Volume B. ISBN 0-12-234001-9
  • W. Thomas, Classifying Regular Events in Symbolic Logic. J. Comput. Syst. Sci. 25(3): 360-376 (1982)
  • J.-E. Pin, Syntactic semigroups, Chapter 10 in "Handbook of Formal Language Theory", Vol. 1, G. Rozenberg and A. Salomaa (eds.), Springer Verlag, (1997) Vol. 1, pp. 679–746
  • A. de Luca and S. Varicchio, Regularity and Finiteness Conditions, Chapter 11 in "Handbook of Formal Language Theory", Vol. 1, G. Rozenberg and A. Salomaa (eds.), Springer Verlag, (1997) Vol. 1, pp. 747–810
  • V. Diekert, P. Gastin, M. Kufleitner, A Survey on Small Fragments of First-Order Logic over Finite Words. Int. J. Found. Comput. Sci. 19(3): 513-548 (2008)
  • J. Shallit, A Second Course in Formal Languages and Automata Theory, Cambridge University Press (2009)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.