Publications by Janusz Brzozowski

Updated October 28, 2014
The publications for 1962-1984 (Journals), 2000-2013 are up-to-date and available. Click on the year.

2015 2014 2013 2012 2011 2010
2009 2008 2007 2006 2005 2004 2003 2002 2001 2000
1999 1998 1997 1996 1995 1994 1993 1992 1991 1990
1989 1988 1987 1986 1985 1984 1983 1982 1981 1980
1979 1978 1977 1976 1975 1974 1973 1972 1971 1970
1969 1968 1967 1966 1965 1964 1963 1962

See also Maveric Group Publications for older papers.

List of papers on Asynchronous Circuit Theory (pdf). Last updated August 30, 2010

The list below is in a different format and the papers are not yet available on line.

Theses
Books
Contributions to Books
Journal Papers 2001 -
Journal Papers 1991 -
Journal Papers 1981 - 1990
Journal Papers 1971 - 1980
Journal Papers 1962 - 1970
Conference Papers 1991 -
Conference Papers 1981 - 1990
Conference Papers 1971 - 1980
Conference Papers 1962 - 1970

Go back to J. Brzozowski's home page .


2015

JOURNALS

CONFERENCES

  • (C91) J. Brzozowski, M. Szykula. Upper Bound on Syntactic Complexity of Suffix-Free Languages.
    17th International Workshop on Descriptional Complexity of Formal Systems., DCFS 2014,
    Waterloo, ON, Canada, June 25-27, 2014. J. Shallit, A. Okhotin, eds., LNCS 9118, 2014.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • Go to the top of this document.


    2014

    JOURNALS

  • (J84) J. Brzozowski, B. Li. Syntactic Complexity of R- and J-Trivial Languages.
    Internat. J. Found. Comput. Sci. 25(7), 807-821, 2014.

  • (J83) J. Brzozowski, G. Jiraskova, B. Li, J. Smith. Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages.
    Acta Cybernet. 21(4), 505-527, 2014.

  • (J82) J. Brzozowski, H. Tamm. Theory of A'tomata.
    Theoret. Comput. Sci., 539, 13-27, 2014.

  • (J81) J. Brzozowski, G. Jiraskova, C. Zou. Quotient Complexity of Closed Languages.
    Theory Comput. Syst. 54, 277-292, 2014.

    CONFERENCES

  • (C90) J. Brzozowski, M. Szykula. Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.
    18th International Conference on Developments in Language Theory, DLT 2014,
    Ekaterinburg, Russia, August 26-29, 2014. A. M. Shur, M. V. Volkov, eds., LNCS 8633, 13-24, 2014.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication will be available at www.springerlink.com

  • (C89) J. Brzozowski, G. Davies. Most Complex Regular Right-Ideal Languages.
    16th International Workshop on Descriptional Complexity of Formal Systems., DCFS 2014,
    Turku, Finland, August 5-8, 2014. H. Jurgensen et al., eds., LNCS 8614, 90-101, 2014.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C88) J. Brzozowski, M. Szykula. Large Aperiodic Semigroups.
    19th International Conference on Implementation and Application of Automata, CIAA 2014,
    Giessen, Germany, July 30-August 2, 2014. M. Holzer, M. Kutrib, eds., LNCS 8587, 124-135, 2014.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C87) J. Bell, J. Brzozowski, N. Moreira, R. Reis. Symmetric Groups and Quotient Complexity of Boolean Operations.
    41st International Colloquium on Automata, Languages, and Programming, ICALP 2014,
    Copenhagen, Denmark, July 8-11, 2014. J. Esparza et al., eds., LNCS 8573, 1-12, 2014.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C86) J. Brzozowski, G. Davies. Maximally Atomic Languages.
    14th International Conference Automata and Formal Languages, AFL 2014,
    Szeged, Hungary, May 27-29, 2014. Z. Esik, Z. Fulop, eds., EPTCS 151, 2014. pp. 151-161. EPTCS

    ARXIV

  • J. Brzozowski, M. Szykula. Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.
    Revised 3 July 2014 arXiv

  • J. Brzozowski, M. Szykula. Large Aperiodic Semigroups.
    Revised 19 June 2014 arXiv

  • J. Brzozowski, M. Szykula. Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.
    9 March 2014 arXiv

  • J. Brzozowski, M. Szykula. Large Aperiodic Semigroups.
    1 January 2014 arXiv

  • Go to the top of this document.


    2013

    JOURNALS

  • (J80) J. Brzozowski, H. Tamm. Complexity of Atoms of Regular Languages.
    Internat. J. Found. Comput. Sci. 24(7), 1009-1027, 2013.

  • (J79) J. Brzozowski. In Search of Most Complex Regular Languages.
    Internat. J. Found. Comput. Sci. 24(6), 691-708, 2013.

  • (J78) J. Brzozowski, G. Jiraskova, B. Li. Quotient Complexity of Ideal Languages.
    Theoret. Comput. Sci., 470, 36-52, 2013. pdf

    CONFERENCES

  • (C85) J. Brzozowski, B. Li. Syntactic Complexities of R- and J-Trivial Regular Languages.
    15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013,
    London, ON, July 22-25, 2013. H. Jurgensen, R. Reis, eds., LNCS 8031, 160-171, 2013.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C84) J. Brzozowski, D. Liu. Universal Witnesses for State Complexity of Boolean Operations and Concaternation Combined with Star.
    15th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2013,
    London, ON, July 22-25, 2013. H. Jurgensen, R. Reis, eds., LNCS 8031, 30-41, 2013.
    Copyright Springer-Verlag GmbH Berlin Heidelberg.The publication is available at www.springerlink.com

  • (C83) J. Brzozowski, D. Liu. Universal Witnesses for State Complexity of Basic Operations Combined with Reverse.
    18th International Conference on Implementation and Application of Automata, CIAA 2013,
    Halifax, NS, July 16-19, 2013. S. Konstantinidis, ed., LNCS 7982, 72-83, 2013.
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    ARXIV

  • J. Brzozowski, G. Davies. Most Complex Regular Right-Ideal Languages.
    18 November 2013. arXiv

  • J. Bell, J. Brzozowski, N. Moreira, R. Reis. Symmetric Groups and Quotient Complexity of Boolean Operations.
    7 October 2013. arXiv

  • J. Brzozowski, G. Davies. Maximally Atomic Languages.
    20 August 2013. arXiv

  • J. Brzozowski, H. Tamm. Theory of A'tomata.
    19 August 2013. arXiv

  • J. Brzozowski, G. Davies. Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexity of Atoms.
    Revised 22 May 2013. arXiv

  • J. Brzozowski, G. Davies. Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexity of Atoms.
    15 February 2013. arXiv

  • J. Brzozowski, B. Li. Syntactic Complexity of R- and J-Trivial Regular Languages.
    Revised 3 February 2013. arXiv

  • J. Brzozowski, H. Tamm. Minimal Nondeterministic Finite Automata and Atoms of Regular Languages.
    23 January 2013. arXiv

  • Go to the top of this document.


    2012

    JOURNALS

  • (J77) J. Brzozowski, B. Li, D. Liu. Syntactic Complexities of Six Classes of Star-Free Languages.
    J. Autom. Lang. Comb. 17 (2-4), 83-105, 2012.

  • (J76) J. Brzozowski, B. Liu. Quotient Complexity of Star-Free Languages.
    Internat. J. Found. Comput. Sci. 23(6), 1261-1276, 2012.

  • (J75) J. Brzozowski, B. Li, Y. Ye. Syntactic Complexity of Prefix-, Suffix-, Bifix-, and Factor-Free Regular Languages.
    Theoret. Comput. Sci. 449, 37-53, 2012. pdf

  • (J74) J. Brzozowski, B. Li, Y. Ye. On the Complexity of the Evaluation of Transient Extensions of Boolean Functions.
    Internat. J. Found. Comput. Sci. 23 (1), 21-35, 2012. pdf

    CONFERENCES

  • (C82) J. Brzozowski, H. Tamm. Quotient Complexities of Atoms of Regular Languages.
    16th International Conference on Developments in Language Theory, DLT 2012,
    Taipei, Taiwan, August 14-17, 2012. H.-C. Yen, O. H. Ibarra, eds., LNCS 7410, 50-61,2012. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C81) J. Brzozowski, B. Li. Syntactic Complexities of Some Classes of Star-Free Languages.
    14th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2012,
    Braga, Portugal, July 23-25, 2012. M. Kutrib, N. Moreira, R. Reis, eds., LNCS 7386, 117-129, 2012. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C80) J. Brzozowski. In Search of Most Complex Regular Languages.
    17th International Conference on Implementation and Application of Automata, CIAA 2012,
    Porto, Portugal, July 17-25, 2012. N. Moreira, R. Reis, eds., LNCS 7381, 5-24, 2012. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    ERRATA:

    1. The following reference should be added:
    G. Liu, C. Martin-Vide, C. Salomaa, S. Yu. State complexity of basic language operations combined with reversal,
    Inform. and Comput. 206 (2008) 1178-1186.
    2. The statement before Conjecture 3 on p. 17 should cite the reference above, and should state that ternary witnesses were used. The conjecture is false for m=n=4, but true when the final states are changed as follows: For K let the set of final states be {0, 2}, and for L, {1, 3}, except when n=3; then use {1}. See the arxiv paper under CONJECTURES below.
    3. The sentence before Conjecture 4 should be removed.
    4. The paragraph on p. 21 after Conjecture 17 should correct the authors of [7] to Cui, Gao, Kari and Yu, and state that ternary witnesses were used.
    CONJECTURES 7, 9, 10, 12, 15, and 17 have now been proved. See arxiv.org/abs/1207.1982
    CONJECTURES 1, 2, 3, 4, 8, 11 and 14 have now been proved. See arxiv.org/abs/1207.0535

    ARXIV

  • J. Brzozowski, B. Li. Syntactic Complexity of R- and J-Trivial Regular Languages.
    23 August 2012. arXiv

  • J. Brzozowski, D. Liu. Universal Witnesses for State Complexity of Boolean Operations Combined with Star
    9 July 2012. arXiv

  • J. Brzozowski, D. Liu. Universal Witnesses for State Complexity of Basic Operations Combined with Reversal.
    2 July 2012. arXiv

  • J. Brzozowski, D. Liu. Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages.
    Revised 21 June 2012. arXiv

  • J. Brzozowski, D. Liu. Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages.
    13 March 2012. arXiv

  • J. Brzozowski, H. Tamm. Quotient Complexity of Atoms of Regular Languages.
    Revised 9 March 2012. arXiv

  • Go to the top of this document.


    2011

    JOURNALS

  • (J73) J. Brzozowski, E. Grant, J. Shallit. Closures in Formal Languages and Kuratowski's Theorem.
    Internat. J. Found. Comput. Sci. 22, (2), 310-321, 2011. pdf

  • (J72) J. Brzozowski, J. Shallit, Z. Xu. Decision Problems for Convex Langages.
    Inform. and Comput. 209, 353-367, 2011. pdf

    CONFERENCES

  • (C79) J. Brzozowski, B. Liu. Quotient Complexity of Star-Free Languages.
    13th International Conference on Automata and Formal Languages, AFL 2011,
    Debrecen, Hungary, August 17-22, 2011. P. Domosi, I. Szabolcs, eds., Institute of Mathematics and Informatics,
    College of Nyiregyhaza, Nyiregyhaza, Hungary, 138-152, 2011. pdf

  • (C78) J. Brzozowski, G. Jiraskova, B. Li, J. Smith. Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages.
    13th International Conference on Automata and Formal Languages, AFL 2011,
    Debrecen, Hungary, August 17-22, 2011. P. Domosi, I. Szabolcs, eds., Institute of Mathematics and Informatics,
    College of Nyiregyhaza, Nyiregyhaza, Hungary, 123-137, 2011. pdf

  • (C77) J. Brzozowski, B. Li, Y. Ye. Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages.
    13th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2011,
    Limburg, Germany, July 25-27, 2011. M. Holzer, M. Kutrib, G. Pighizzini, eds., LNCS 6808, 93-106, 2011. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C76) J. Brzozowski, H. Tamm. Theory of Atomata.
    15th International Conference on Developments in Language Theory, DLT 2011,
    Milan, Italy, July 19-22, 2011. G. Mauri, A. Leporati, eds., LNCS 6795, 105-116, 2011. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C75) J. Brzozowski, Y. Ye. Syntactic Complexity of Ideal and Closed Languages.
    15th International Conference on Developments in Language Theory, DLT 2011,
    Milan, Italy, July 19-22, 2011. G. Mauri, A. Leporati, eds., LNCS 6795, 117-128, 2011. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    ARXIV

  • J. Brzozowski, H. Tamm. Quotient Complexity of Atoms of Regular Languages.
    31 December 2011. arXiv

  • J. Brzozowski, B. Li, Y. Ye. Syntactic Complexity of Prefix-, Suffix-, Bifix- and Factor-Free Languages.
    18 November 2011. arXiv

  • J. Brzozowski, B. Li. Syntactic Complexity of Star-Free Languages.
    15 September 2011. arXiv

  • J. Brzozowski, G. Jiraskova, B. Li, J. Smith. Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages.
    Re-revised version with several new results. 11 May, 2011. arxiv

  • J. Brzozowski, B. Li, Y. Ye. Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages.
    15 March 2011. arXiv

  • J. Brzozowski, H. Tamm. Theory of A'tomata.
    18 February 2011. arXiv

  • Go to the top of this document.


    2010

    JOURNALS

  • (J71) J. Brzozowski. Quotient Complexity of Regular Languages.
    J. Autom., Lang. Comb. 15 (1/2), 71-89, 2010. pdf

  • (J70) J. Brzozowski, Y. Ye. Gate Circuits with Feedback in Finite Multivalued Algebras of Transients.
    J. Mult.-Valued Logic Soft Comput. 16, 155-176, 2010. pdf

    CONFERENCES

  • (C74) J. Brzozowski, B. Li, Y. Ye. On the Complexity of the Evaluation of Transient Extensions of Boolean Functions.
    12th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2010,
    Saskatoon, SK, Canada, August 8-10, 2010. I. McQuillan, G. Pighizzini, eds.,
    Technical Report 2010-02, Department of Computer Science, University of Saskatchewan, pp. 38-49. pdf and EPTCS

  • (C73) J. Brzozowski, G. Jiraskova, C. Zou. Quotient Complexity of Closed Languages.
    5th International Computer Science Symposium in Russia, CSR 2010,
    Kazan, Russia, June 16-20, 2010. F. Ablayev, E. W. Mayr, eds., LNCS 6072, 84-95, 2010. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C72) J. Brzozowski Complexity in Convex Languages.
    4th International Conference on Language and Automata Theory and Applications, LATA 2010,
    Trier, Germany, May 24-28, 2010. A.-H. Dediu, H. Fernau, C. Martin-Vide, eds., LNCS 6031, 1-15, 2010. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C71) J. Brzozowski, G. Jiraskova, B. Li. Quotient Complexity of Ideal Languages.
    9th Latin American Symposium on Theoretical Informatics. LATIN 2010,
    Oaxaca, Mexico, April 19-23, 2010. A. Lopez-Ortiz, ed., LNCS 6034, 208-221, 2010. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    ARXIV

  • J. Brzozowski, B. Liu. Quotient Complexity of Star-Free Languages
    17 December 2010. arXiv

  • J. Brzozowski, G. Jiraskova, J. Smith. Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages.
    6 December, 2010. arXiv, Revised Version

  • J. Brzozowski, Y. Ye. Syntactic Complexity of Ideal and Closed Languages.
    15 October 2010. arXiv

  • J. Brzozowski, G. Jiraskova, J. Smith. Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages.
    June 24, 2010. arXiv

  • Go to the top of this document.


    2009

    JOURNALS

  • (J69) T. Ang, J. Brzozowski. Languages Convex with Respect to Binary Relations and Their Closure Properties.
    Acta Cybernet. 19, 445-464, 2009. pdf and Corrected version posted 24 February 2011

  • (J68) J. Brzozowski, N. Santean. Predictable Semiautomata.
    Theoret. Comput. Sci. 410, 3236-3249, 2009. pdf

  • (J67) J. Brzozowski, S. Konstantinidis. State Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.
    Theoret. Comput. Sci. 410, 3223-3235, 2009. pdf

    CONFERENCES

  • (C70) J. Brzozowski. Quotient Complexity of Regular Languages.
    Descriptional Complexity of Formal Systems, DCFS 2009
    Magdeburg, Germany, July 6-9, 2009. J. Dassow, G. Pighizzini, B. Truthe, eds.,
    Otto-von-Guericke-Universit"at Magdeburg, 25-42, 2009. pdf and Extended Abstract arXiv

  • (C69) J. Brzozowski, E. Grant, J. Shallit. Closures in Formal Languages and Kuratowski's Theorem.
    Developments in Language Theory, DLT 2009,
    Stuttgart, Germany, June 30-July 3, 2009. V. Diekert, D. Nowotka, eds., LNCS 5583, 125-144, 2009. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C68) J. Brzozowski, J. Shallit, Z. Xu. Decision Problems for Convex Languages.
    Language and Automata Theory and Applications, LATA 2009,
    Tarragona, Spain, April 2-8, 2009. A. Dediu, A. Ionescu, C. Martin-Vide, eds., LNCS 5457, 247-258, 2009. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    ARXIV

  • J. Brzozowski, G. Jiraskova, C. Zou. Quotient Complexity of Closed Languages.
    December 5, 2009. arXiv

  • J. Brzozowski, G. Jiraskova, B. Li. Quotient Complexity of Ideal Languages.
    August 14, 2009. Full paper: arXiv

    Go to the top of this document.


  • 2008

    CONFERENCES

  • (C67) J. Brzozowski, N. Santean. Determinism without Determinization.
    Descriptional Complexity of Formal Systems, DCFS 2008
    Charlottetown, Prince Edward Island, July 16-18, 2008. C. Campeanu, G. Pighizzini, eds.,
    University of Prince Edward Island, 109-120, 2008. pdf

  • (C66) J. Brzozowski, S. Konstantinidis. State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.
    Descriptional Complexity of Formal Systems, DCFS 2008
    Charlottetown, Prince Edward Island, July 16-18, 2008. C. Campeanu, G. Pighizzini, eds.,
    University of Prince Edward Island, 97-108, 2008. pdf

  • (C65) T. Ang, J. Brzozowski. Continuous Languages.
    Automata and Formal Languages, AFL 2008
    Balatonf"ured, Hungary, May 27-30, 2008. E. Csuhaj-Varju and Z. Esik, eds.,
    Computer and Information Research Institute, Hungarian Academy of Sciences, 74-85, 2008. pdf

    Go to the top of this document.


  • 2007

    JOURNALS

  • (J66) J. Brzozowski, H. Jurgensen. Representations of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules,
    Int. J. Found. Comput. Sci. 18, 1065-1087, 2007. pdf

    CONFERENCES

  • (C64) J. Brzozowski, Y. Ye. Simulation of Gate Circuits with Feedback in Multi-Valued Algebras.
    International Symposium on Multiple-Valued Logic, ISMVL 2004
    Oslo, Norway, May 14-15, 2007.
    IEEE Computer Society, paper 46, 6 pp., 2007. pdf

    Go to the top of this document.


  • 2006

    JOURNALS

  • (J65) Y. Ye. J. Brzozowski. Covering of Transient Simulation of Feedback-Free Circuits by Binary Analysis.
    Int. J. Found. Comput. Sci. 17, 949-973, 2006. pdf

  • (J64) J. Brzozowski. Representation of a Class of Nondeterministic Semiautomata by Canonical Words.
    Theoretical Computer Science 356, 46-57, 2006. pdf

    BOOK CHAPTER

  • J. Brzozowski. Topics in Asynchronous Circuit Theory.
    In Recent Advances in Formal Languages and Applications, Studies in Computational Intelligence 25.
    Z. Esik, C. Martin-Vide, and V. Mitrana, eds., Springer, 11-42, 2006. pdf

    Go to the top of this document.


  • 2005

    JOURNALS

  • (J63) J. Brzozowski, H. Jurgensen. Representation of Semiautomata by Canonical Words and Equivalences.
    Int. J. Found. Comput. Sci. 16, 831-850, 2005. pdf (Corrected after publication)

  • (J62) J. Brzozowski, M. Gheorghiu. Gate Circuits in the Algebra of Transients.
    Theor. Inform. Appl. 39, 67-91, 2005. pdf

    Go to the top of this document.


  • 2004

    JOURNALS

  • (J61) J. Brzozowski. Involuted Semilattices and Uncertainty in Ternary Algebras.
    Internat. J. Algebra Comput. 14, 295-310, 2004. pdf

    BOOK CHAPTER

  • J. Brzozowski, R. Negulescu. Duality for Three: Ternary Symmetry in Process Spaces.
    In: Theory is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday.
    J. Karhumaki, H. Maurer, G. Paun, G. Rozenberg, eds., LNCS 3113, Springer, 1-14, 2004. pdf

    CONFERENCES

  • (C63) J. Brzozowski, H. Jurgensen. Representation of Semiautomata by Canonical Words and Equivalences.
    Descriptional Complexity of Formal Systems, DCFS 2004
    London, ON, July 26-28, 2004. L. Ilie, D. Wotschke, eds.,
    Report No. 619, Dept. of Computer Science, University of Western Ontario, London, ON, Canada, 13-27, 2004. pdf

    Go to the top of this document.


  • 2003

    JOURNALS

  • (J60) J. A. Brzozowski, T. Luba. Decomposition of Boolean Functions Specified by Cubes.
    J. Mult.-Valued Logic Soft Comput. 9, 377-417, 2003. pdf

  • (J59) M. Gheorghiu, J. Brzozowski. Simulation of Feedback-Free Circuits in the Algebra of Transients.
    Internat. J. Found. Comput. Sci., 14, 1033-1054, 2003. pdf

  • (J58) J. Brzozowski, Z. Esik. Hazard Algebras.
    Formal Methods System Design 23, 223-256, 2003. pdf

  • (J57) S. Silver, J. A. Brzozowski. True Concurrency in Models of Asynchronous Circuit Behavior.
    Formal Methods System Design 22, 183-203, 2003. pdf

    BOOK CHAPTER

  • J. Brzozowski, Z. Esik, Y. Iland. Algebras for Hazard Detection.
    In: Beyond Two - Theory and Applications of Multiple-Valued Logic,
    M. Fitting and E. Orlowska, eds., Physica-Verlag, Heidelberg, 3-24, 2003. pdf (Reprinted from ISMVL 2001)

    CONFERENCES

  • (C62) M. Gheorghiu, J. Brzozowski. Feedback-Free Circuits in the Algebra of Transients.
    Implementation and Application of Automata, (Revised papers from CIAA 2002)
    J.-M. Champarnaud, D. Maurel, eds., LNCS 2608, 106-116, 2003. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

  • (C61) J. Brzozowski, M. Gheorghiu. Simulation of Gate Circuits in the Algebra of Transients.
    Implementation and Application of Automata, (Revised papers from CIAA 2002)
    J.-M. Champarnaud, D. Maurel, eds., LNCS 2608, 57-66, 2003. pdf
    Copyright Springer-Verlag GmbH Berlin Heidelberg. The publication is available at www.springerlink.com

    Go to the top of this document.


  • 2002

    JOURNALS

  • (J56) P. R. Sidorowicz, J. Brzozowski. A Framework for Testing Special-Purpose Memories.
    IEEE Transactions on Computer-Aided Design, 21, 1459-1468, 2002.
    pdf

    CONFERENCES

  • (C60) M. Gheorghiu, J. Brzozowski. Feedback-Free Circuits in the Algebra of Transients.
    7th Int. Conf. on Implementation and Application of Automata CIAA 2003,
    Tours, France, July 3 - 5, 2002. See 2003.

  • (C59) J. Brzozowski, M. Gheorghiu. Simulation of Gate Circuits in the Algebra of Transients.
    7th Int. Conf. on Implementation and Application of Automata CIAA 2003,
    Tours, France, July 3 - 5, 2002. See 2003.

  • (C58) J. Brzozowski. Partially Ordered Structures for Hazard Detection.
    Joint Mathematics Meetings, Special Session: The Many Lives of Lattice Theory,
    San Diego, CA, January 6-9, 2002. (Invited Paper) ps.gz

    Go to the top of this document.


  • 2001

    JOURNALS

  • (J55) J. A. Brzozowski. A Characterization of De Morgan Algebras.
    International Journal of Algebra and Computation, 11, 525-527, 2001. pdf

    BOOK CHAPTER

  • J. Brzozowski, Z. Esik. Hazard Algebras.
    In Half Century of Automata Theory.
    A. Salomaa, D. Wood, and S. Yu, eds., World Scientific, Singapore, 1-19, 2001. ps.gz

    CONFERENCES

  • (C57) J. A. Brzozowski, Z. Esik, and Y. Iland. Algebras for Hazard Detection,
    31st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2001,
    Warsaw, Poland, May 22 - 24, 2001. IEEE Computer Society, 3-12, 2001. ps.gz

    Go to the top of this document.


  • 2000

    ENCYCLOPEDIA ARTICLE

  • J. Brzozowski. Sequential Machines.
    In
    Encyclopedia of Computer Science, Fourth Edition.
    A. Ralston, E. D. Reilly, D. Hemminger, eds., Grove's Dictionaries, Inc., New York, 1565-1569, 2000.

    JOURNALS

  • (J54) J. A. Brzozowski. Delay-Insensitivity and Ternary Simulation.
    Theoret. Comput. Sci. 45, 3-25, 2000. pdf

  • (J53) J. A. Brzozowski, R. Negulescu. Automata of Asynchronous Behaviors.
    Theoret. Comput. Sci. 231, 113-128, 2000. pdf

  • (J52) J. A. Brzozowski, H. Zhang. Delay-Insensitivity and Semi-Modularity.
    Formal Methods in System Design, 16, 187-214, 2000. pdf

    CONFERENCES

  • (C56) J. Brzozowski, Z. Esik. Hazard Algebras (extended abstract).
    Half Century of Automata Theory,
    London, ON, July 26, 2000. See 2001.

  • (C55) J. Brzozowski. De Morgan Bisemilattices.
    30th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2000,
    Portland, Oregon, May 23 - 25, 2000. IEEE Computer Society, 173-178, 2000. pdf

  • Go to the top of this document.


    1999

    JOURNALS

  • (J51) J. A. Brzozowski. Some Applications of Ternary Algebras.
    Publ. Math. Debrecen
    54(supplement), 583-589, 1999. PDF

  • (J50) C. J. Shi, J. A. Brzozowski. A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis.
    Discrete Appl. Math. 90, 223-243, 1999. PDF

    CONFERENCES

  • (C54) J. Lou, J. A. Brzozowski. A Generalization of Shestakov's Function Decomposition Method.
    International Symposium on Multiple-Valued Logic. Freiburg, Germany, May 20-22, 1999.
  • Go to the top of this document.


    1998

    JOURNALS

  • (J49) C. J. Shi, J. A. Brzozowski. Cluster Cover: A Theoretical Framework for a Class of VLSI_CAD Optimization Problems.
    ACM Trans. Des. Autom.
    3(1), 76-115, 1998. PDF

  • (J48) R. Negulescu, J. A. Brzozowski. Relative Liveness: From Intuition to Automated Verification.
    Formal Methods in Syst. Des. 12(1), 73-115, 1998. PDF

    CONFERENCES

  • (C53) P. R. Sidorowicz, J. A. Brzozowski. Verification of CAM Tests for Input Stuck-at Faults.
    1998 IEEE International Workshop on Memory Technology, Design and Testing. San Jose, CA, August 24 - 25, 1998.

  • (C52) P. R. Sidorowicz, J. A. Brzozowski. An Approach to Modeling and Testing Memories and its Application to CAMs.
    16th IEEE VLSI Test Symposium. Monterey, CA, April 27 - 30, 1998.

  • Go to the top of this document.


    1997

    JOURNALS

  • (J47) J. A. Brzozowski, J. J. Lou, R. Negulescu. A Characterization of Finite Ternary Algebras.
    Int. J. Algebra Comput.
    7(6), 713-721, 1997. PDF

  • (J46) R. David, J. A. Brzozowski, H. Jurgensen. Testing of Bounded Faults in RAMs.
    J. Electron. Testing: Theory and Appl. 10(3), 197-214, 1997. PDF

    CONFERENCES

  • (C51) J. A. Brzozowski, R. Negulescu. Automata of Asynchronous Behaviors.
    pp. 29-45 in D. Wood and S. Yu, eds., Automata Implementation. (Second International Workshop on Implementing Automata (WIA97),
    London, Ontario, Canada, September 18-20, 1997: REVISED PAPERS) LNCS 1436 Springer, Berlin, 1998.

  • (C50) J. A. Brzozowski. Delay-Insensitivity and Ternary Simulation.
    First International Conference on Semigroups and Algebraic Engineering. Aizu-Wakamatsu City, Japan, March 24-28, 1997.

  • (C49) J. A. Brzozowski, J. J. Lou. Blanket Algebra for Multiple-Valued Function Decomposition.
    International Workshop on Formal Languages and Computer Systems. Kyoto, Japan, March 18-21, 1997.

  • Go to the top of this document.


    1996

    JOURNALS

  • (J45) J. A. Brzozowski, H. Jurgensen. An Algebra of Multiple Faults in RAMs.
    J. Electron. Testing: Theory and Appl.
    8(2), 129-142, 1996. PDF
    Erratum. J. Electron. Testing: Theory and Appl. 14, 305-306, 1999. PDF

  • (J44) J. A. Brzozowski, H. Jurgensen. Applications of Automata and Languages to Testing.
    Publ. Math. Debrecen 48(3-4), 201-215, 1996. PDF

    CONFERENCES

  • (C48) J. A. Brzozowski. Some Applications of Ternary Algebras.
    8th International Conference on Automata and Formal Languages. Salgotarjan, Hungary, July 29 - August 2, 1996.

  • Go to the top of this document.


    1995

      CONFERENCES

    • (C47) C.-J. Shi, J. A. Brzozowski. A Framework for the Analysis and Design of Algorithms for a Class of VLSI Optimization Problems.
      Asia and South Pacific Design Automation Conference.
      Chiba, Japan, August 29-September 1, 1995
      IEEE Computer Society Press, Los Alamitos, CA
      pp. 67-74, 1995

    • (C46) J. A. Brzozowski, H. Jurgensen. Composition of Multiple Faults in RAMs.
      IEEE International Workshop on Memory Technology, Design and Testing. San Jose, CA, August 7-8, 1995.
      IEEE Computer Society Press, Los Alamitos, CA, pp. 123-128, 1995.

    • (C45) J. A. Brzozowski, K. Raahemifar. Testing C-Elements Is Not Elementary.
      Second Working Conference on Asynchronous Design Methodologies. London, England, May 30-31, 1995.
      IEEE Computer Society Press, Los Alamitos, CA, pp. 150-159, 1995.

    • (C44) R. Negulescu, J. A. Brzozowski. Relative Liveness: From Intuition to Automated Verification.
      Second Working Conference on Asynchronous Design Methodologies. London, England, May 30-31, 1995.
      IEEE Computer Society Press, Los Alamitos, CA, pp. 108-117, 1995.

    Go to the top of this document.


    1994

    JOURNALS

  • (J43) C-J. Seger, J. A. Brzozowski. Generalized Ternary Simulation of Sequential Circuits.
    Theor. Inform. Appl.
    28(3-4), 159-186, 1994. PDF

  • Go to the top of this document.


    1993

    JOURNALS

  • (J42) C. J. Shi, J. A. Brzozowski. An Efficient Algorithm for Constrained Encoding and Its Applications.
    IEEE Trans. Computer-Aided Design
    12(12), 1813-1836, 1993. PDF

    CONFERENCES

  • (C43) J. A. Brzozowski, H. Jurgensen. An Automaton Theoretic Approach to Circuit Testing.
    Seventh Conference on Automata and Formal Languages. Salgotarjan, Hungary, May 18-21, 1993.

  • (C42) R. David, J. A. Brzozowski, H. Jurgensen. Random Test Length for Bounded Faults in RAMs.
    European Test Conference. Rotterdam, The Netherlands, April 19-24, 1993.
    IEEE Computer Society Press, Los Alamitos, CA, pp. 149-158, 1993.

  • (C41) J. A. Brzozowski. Asynchronous Behaviours and Fundamental-Mode Realizations.
    Seminar on Automata Theory: Distributed Models. Dagstuhl, Germany, January 11-15, 1993.
    Dagstuhl Seminar Report 54, pp. 4-5, 1993.

  • Go to the top of this document.


    1992

    JOURNALS

  • (J41) J. A. Brzozowski, J. C. Ebergen. On the Delay-Sensitivity of Gate Networks.
    IEEE Trans. Comput.
    41(10), 1349-1360, 1992. PDF

  • (J40) B. F. Cockburn, J. A. Brzozowski. Near Optimal Tests for Classes of Write-Triggered Coupling Faults in RAMs.
    J. Electron. Testing: Theory and Appl. 3(3), 251-264, 1992. PDF

  • (J39) J. A. Brzozowski, H. Jurgensen. A Model for Sequential Machine Testing and Diagnosis.
    J. Electron. Testing: Theory and Appl. 3(3), 219-234, 1992. PDF

    CONFERENCES

  • (C40) J. A. Brzozowski, H. Jurgensen. Automaton-Theoretic Considerations in Circuit Testing.
    Second Theoriedag. Kiel, Germany, October 2-3, 1992, 4 pp.

  • (C39) C.-J. Shi, J. A. Brzozowski. Efficient Constrained Encoding for VLSI Sequential Logic Synthesis.
    European Design Automation Conference. Hamburg, Germany, September 7-10, 1992.
    IEEE Computer Society Press, Los Alamitos, CA, pp. 266-271, 1992.

  • (C38) J. A. Brzozowski, H. Jurgensen. Component Automata and RAM Faults.
    Second International Colloquium on Words, Languages and Combinatorics. Kyoto, Japan, August 25-28, 1992, pp. 6-10, 1992

  • Go to the top of this document.


    1991

    JOURNALS

  • (J38) J. A. Brzozowski, A. J. Gahlinger, F. Mavaddat. Consistency and Satisfiability of Waveform Timing Specifications.
    Networks
    21(1), 91-107, 1991. PDF

  • Go to the top of this document.


    1990

    JOURNALS

  • (J37) J. A. Brzozowski, B. F. Cockburn. Detection of Coupling Faults in RAMs.
    J. Electron. Testing: Theory and Appl.
    1(2), 151-162, 1990. PDF

  • (J36) B. F. Cockburn, J. A. Brzozowski. Switch-Level Testability of the Dynamic CMOS PLA.
    Integration, The VLSI Journal 9(1), 49-80, 1990. PDF

    CONFERENCES

  • (C37) B. F. Cockburn, J. A. Brzozowski. Near-Optimal Tests for Classes of Coupling Faults in RAMs.
    Poster Paper, International Test Conference. Nashville, TN, October 28 - November 1, 1991.

  • (C36) B. F. Cockburn, J. A. Brzozowski. Near-Optimal Tests for Classes of Coupling Faults in RAMs.
    Fifth Technical Workshop on New Directions in IC Testing. Ottawa, Ontario, August 1-2, 1991.

  • Go to the top of this document.


    1989

    JOURNALS

  • (J35) J. A. Brzozowski, C-J. Seger. A Unified Framework for Race Analysis of Asynchronous Networks.
    J. ACM
    36(1), 20-45, 1989. PDF

    CONFERENCES

  • (C35) J. A. Brzozowski, J. C. Ebergen. Recent Developments in the Design of Asynchronous Circuits.
    International Conference on Fundamentals of Computation Theory. Szeged, Hungary, August 21-25, 1989.
    J. Csirik, J. Demetrovics, and F. Gecseg, eds., LNCS 380 Springer-Verlag, Berlin, pp. 78-94, 1989.

  • Go to the top of this document.


    1988

    JOURNALS

  • (J34) C-J. Seger, J. A. Brzozowski. An Optimistic Ternary Simulation of Gate Races.
    Theoret. Comput. Sci.
    66(1), 49-66, 1988. PDF

    CONFERENCES

  • (C32) B. F. Cockburn, J. A. Brzozowski. Switch-Level Testability of the Dynamic CMOS PLA.
    Third Technical Workshop on New Directions in IC Testing. Halifax, Nova Scotia, October 26-27, 1988.

  • (C31) J. A. Brzozowski, H. Jurgensen. Probabilistic Diagnosis of Sequential Machines.
    Third Technical Workshop on New Directions in IC Testing. Halifax, Nova Scotia, October 26-27, 1988.

  • (C30) J. A. Brzozowski, H. Jurgensen. Deterministic Diagnosis of Sequential Machines.
    Third Technical Workshop on New Directions in IC Testing. Halifax, Nova Scotia, October 26-27, 1988.

  • (C29) J. A. Brzozowski, H. Jurgensen. Probabilistic Diagnosis of Sequential Machines.
    Second Conference on Automata Languages and Programming Systems. Salgotarjan, Hungary, May 23-26, 1988.
    F. Gecseg and I. Peak, eds., Department of Mathematics, Karl Marx University of Economics, Budapest, Hungary, pp. 51-66, 1988.

  • (C28) J. A. Brzozowski, H. Jurgensen. Deterministic Diagnosis of Sequential Machines.
    Second Conference on Automata Languages and Programming Systems. Salgotarjan, Hungary, May 23-26, 1988.
    F. Gecseg and I. Peak, eds., Department of Mathematics, Karl Marx University of Economics, Budapest, Hungary. pp. 35-49, 1988.

  • Go to the top of this document.


    1987

    JOURNALS

  • (J33) J. A. Brzozowski, C-J. Seger. A Characterization of Ternary Simulation of Gate Networks.
    IEEE Trans. Comput.
    C36(11), 1318-1327, 1987. PDF

  • (J32) J. A. Brzozowski, M. Yoeli. Combinational Static CMOS Networks.
    Integration, The VLSI Journal 5, 103-122, 1987. PDF

    CONFERENCES

  • (C27) J. A. Brzozowski. A Model for Sequential Machine Testing.
    International Workshop on New Directions in IC Testing. Winnipeg, Manitoba, April 8-10, 1987.
  • Go to the top of this document.


    1986

    JOURNALS

  • (J31) J. A. Brzozowski, R. Knast. Graph Congruences and Pair Testing.
    Theoret. Inform. Appl.
    20(2), 129-147, 1986. PDF

    CONFERENCES

  • (C26) J. A. Brzozowski. On the Testability of Static CMOS Latches.
    Technical Digest of the Canadian Conference on VLSI. Montreal, Quebec, October 27-28, 1986, pp. 153-158, 1986

  • (C25) C-J. Seger, J. A. Brzozowski. An Optimistic Ternary Simulation of Gate Races.
    Technical Digest of the Canadian Conference on VLSI. Montreal, Quebec, October 27-28, 1986, pp. 67-72, 1986.

  • (C24) J. A. Brzozowski. Detection of Timing Problems in VLSI Circuits.
    Proceedings of the Sixteenth Manitoba Conference on Numerical Mathematics and Computing.

    Winnipeg, Manitoba, October 2-4, 1986. In Congressus Numerantium, Vol. 56, pp. 7-18, 1987.

  • (C23) J. A. Brzozowski, C.-J. Seger. Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks.
    13th International Colloquium on Automata, Languages, and Programming.
    Rennes, France, July 15-19, 1986. L. Kott, ed., LNCS 226, 69-78, Springer-Verlag, Berlin, 1986.

  • (C22) J. A. Brzozowski, M. Yoeli. Combinational Static CMOS Networks.
    Aegean Workshop on Computing: VLSI Algorithms and Architectures.
    Loutraki, Greece, July 8-11, 1986, F. Makedon, K. Mehlhorn, T. Papatheodorou and P. Spirakis, eds.,
    LNCS 227, 271-282, Springer-Verlag, Berlin. 1986.

  • (C21) J. A. Brzozowski. Testability of Combinational Networks of CMOS Cells.
    International Workshop on New Directions in IC Testing
    Victoria, British Columbia, March 18-20, 1986. In Developments in Integrated Circuit Testing,
    D. M. Miller, ed., Academic Press, New York, NY, 315-357, 1987.
  • Go to the top of this document.


    1985

    JOURNALS

  • (J30) J. A. Brzozowski, S. Muro. On Serializability.
    Int. J. Comput. Inform. Sc.
    14(6), 387-403, 1985. PDF

    CONFERENCES

  • (C20) J. A. Brzozowski and M. Sayed. Design of Testable CMOS Cells.
    Canadian Conference on VLSI.
    Toronto, Ontario, November 4-5, 1985, 225-228, 1985.

  • (C19) M. Yoeli and J. A. Brzozowski. A Mathematical Model of Digital CMOS Networks.
    Canadian Conference on VLSI.
    Toronto, Ontario, November 4-5, 1985, 117-120, 1985.
  • Go to the top of this document.


    1984

    JOURNALS

  • (J29) J. A. Brzozowski, F. E. Fich. On Generalized Locally Testable Languages.
    Discrete Math.
    50, 153-169, 1984. PDF

  • Go to the top of this document.


    1983

    Go to the top of this document.


    1982

    Go to the top of this document.


    1981

    Go to the top of this document.


    1980

    JOURNALS

  • (J28) J. A. Brzozowski, F. E. Fich. Languages of R-Trivial Monoids.
    J. Comput. System Sci.
    20(1), 32-49, 1980. PDF

  • (J27) J. A. Brzozowski, E. Leiss. On Equations for Regular Languages, Finite Automata, and Sequential Networks.
    Theoret. Comput. Sci. 10, 19-35, 1980. PDF

    CONFERENCES

  • (C18) J. A. Brzozowski. Developments in the Theory of Regular Languages.
    IFIP Congress 80.
    Tokyo, Japan, October 6-9; Melbourne, Australia, October 14-17, 1980. S. Lavington, ed., North Holland, Amsterdam, 29-40, 1980
  • Go to the top of this document.


    1979

    JOURNALS

  • (J26) J. A. Brzozowski, M. Yoeli. On a Ternary Model of Gate Networks.
    IEEE. Trans. Comput.
    C28(3), 178-184, 1979. PDF
  • Go to the top of this document.


    1978

    JOURNALS

  • (J25) J. A. Brzozowski, R. Knast. The Dot-Depth Hierarchy of Star-Free Languages is Infinite.
    J. Comput. System Sci.
    16(1), 37-55, 1978. PDF

  • Go to the top of this document.


    1977

    JOURNALS

  • (J24) J. A. Brzozowski. A Generalization of Finiteness.
    Semigroup Forum 13(3), 239-251, 1977.
    PDF

  • Go to the top of this document.


    1976

    JOURNALS

  • (J23) J. A. Brzozowski. Run Languages.
    Discrete Math. 16(4), 299-307, 1976. PDF

  • (J22) J. A. Brzozowski. Hierarchies of Aperiodic Languages.
    RAIRO 10(8), 33-49, 1976. PDF

  • (J21) J. A. Brzozowski, M. Yoeli. Practical Approach to Asynchronous Gate Networks.
    IEE Proc. 123(6), 495-498, 1976. PDF

  • Go to the top of this document.


    1975

      CONFERENCES

    • (C15) M. Yoeli and J. A. Brzozowski. Ternary Simulation of Binary Gate Networks.
      Fifth International Symposium on Multiple-Valued Logic.
      Bloomington, IN, May 13-16, 1975. In Modern Uses of Multiple-Valued Logic.
      J. M. Dunn and G. Epstein, eds., D. Reidel Publishing Company, Dordrecht, Holland, 39-50, 1977 <\LI>

    Go to the top of this document.


    1974

      CONFERENCES

    • (C14) J. A. Brzozowski, M. Yoeli. Models for Analysis of Races in Sequential Networks.
      Third Symposium on Mathematical Foundations of Computer Science.
      Jadwisin, Poland, June 17-24, 1974, A. Blikle, ed., LNCS 28, Springer-Verlag, Berlin, 26-32, 1975.

    Go to the top of this document.


    1973

    JOURNALS

  • (J20) J. A. Brzozowski, I. Simon. Characterizations of Locally Testable Events.
    Discrete Math. 4(3), 243-271, 1973. PDF

  • Go to the top of this document.


    1972

    JOURNALS

  • (J19) D. K. Banerji, J. A. Brzozowski. On Translation Algorithms in Residue Number Systems.
    IEEE Trans. Comput. C21(12), 1281-1285, 1972. PDF

  • Go to the top of this document.


    1971

    JOURNALS

  • (J18) J. A. Brzozowski K. Culik II, A. Gabrielian. Classification of Noncounting Events.
    J. Comput. System Sc. 5(1), 41-53, 1971. PDF

  • (J17) R. S. Cohen, J. A. Brzozowski. Dot Depth of Star-Free Events.
    J. Comput. System Sc. 5(1), 1-16, 1971. PDF

    CONFERENCES

  • (C13) J. A. Brzozowski and I. Simon. Characterizations of Locally Testable Events.
    Twelfth Annual Symposium on Switching and Automata Theory.
    East Lansing, MI, October 15-18, 1971, IEEE, New York, NY, pp. 166-176, 1971.

  • Go to the top of this document.


    1970

    JOURNALS

  • (J16) R. S. Cohen, J. A. Brzozowski. General Properties of Star Height of Regular Events.
    J. Comput. System Sc. 4(3), 260-280, 1970. PDF

  • Go to the top of this document.


    1969

    JOURNALS

  • (J15) D. K. Banerji, J. A. Brzozowski. Sign Detection in Residue Number Systems.
    IEEE Trans. Comput. C18(4), 313-320, 1969. PDF

  • (J14) J. A. Brzozowski, R. S. Cohen. On Decompositions of Regular Events.
    J. ACM 16(1), 132-144, 1969. PDF

  • Go to the top of this document.


    1968

    JOURNALS

  • (J13) J. A. Brzozowski, S. Singh. Definite Asynchronous Sequential Circuits.
    IEEE Trans. Comput. C17(1), 18-26, 1968. PDF

    CONFERENCES (C12) J. A. Brzozowski. Regular-Like Expressions for Some Irregular Languages.
    Ninth Annual Symposium on Switching and Automata Theory.
    Schenectady, NY, October 15-18, 1968, IEEE, New York, NY, 278-286, 1968.

  • (C11) R. Cohen and J. A. Brzozowski. On Star-Free Events.
    Hawaii International Conference on System Sciences.
    Honolulu, HI, January 29-31, 1968, B. K. Kinariwala and F. F. Kuo, eds., University of Hawaii Press, Honolulu, HI, 1-4, 1968.

  • Go to the top of this document.


    1967

    JOURNALS

  • (J12) J. A. Brzozowski. Roots of Star Events.
    J. ACM 14(3), 466-477, 1967. PDF

  • (J11) J. A. Brzozowski. On Single-Loop Realizations of Sequential Machines.
    Information and Control 10(3), 292-314, 1967. PDF

    CONFERENCES

  • (C10) R. Cohen and J. A. Brzozowski. On the Star Height of Regular Events.
    Eighth Annual Symposium on Switching and Automata Theory
    Austin, TX, October 18-20, 1967, IEEE, New York, NY, pp. 265-279, 1967.

  • (C9) J. A. Brzozowski and R. Cohen. On Decompositions of Regular Events.
    Eighth Annual Symposium on Switching and Automata Theory.
    Austin, TX, October 18-20, 1967, IEEE, New York, NY, pp. 255-264, 1967.

  • Go to the top of this document.


    1966

    JOURNALS

  • (J10) L. Lee, J. A. Brzozowski. An Approximate Method for Computing Blocking Probability in Switching Networks.
    IEEE Trans. Commun. Tech. COM-14(2), 85-93, 1966. PDF

  • (J9) W. A. Davis, J. A. Brzozowski. On the Linearity of Sequential Machines.
    IEEE Trans. Electron. Comput. EC-15(1), 21-29, 1966. PDF

    CONFERENCES

  • (C8) J. A. Brzozowski. Roots of Star Events.
    Switching Circuit Theory and Logical Design.
    Berkeley, CA, October 26-28, 1966, IEEE, New York, NY, 88-95, 1966.

  • (C7) L. Lee, J. A. Brzozowski. An Approximate Method for Computing Blocking Probability in Switching Networks.
    1966 IEEE Communication Conference.
    New York, NY, March 21-24, 1966. IEEE, New York, NY, paper CP 66-101, 1966.

  • Go to the top of this document.


    1965

    JOURNALS

  • (J8) J. A. Brzozowski. Some Problems in Relay Circuit Design.
    IEEE Trans. Electron. Comput. EC-14(4), 630-634, 1965. PDF

  • (J7) J. A. Brzozowski. Regular Expressions for Linear Sequential Circuits.
    IEEE Trans. Electron. Comput. EC-14(2), 148-156, 1965. PDF

    CONFERENCES

  • (C6) J. A. Brzozowski. On Single-Loop Realizations of Automata.
    Switching Circuit Theory and Logical Design.
    Ann Arbor, MI, October 6-8, 1965. IEEE, New York, NY, 84-93, 1965.

  • (C5) J. A. Brzozowski. Synthesis of Sequential Machines.
    Systems and Computer Science.
    London, ON, September 10-11, 1965. J. F. Hart and S. Takasu, eds., University of Toronto Press, Toronto, ON, 14-26, 1967.

  • Go to the top of this document.


    1964

    JOURNALS

  • (J6) J. Brzozowski. Regular Expressions from Sequential Circuits.
    IEEE Trans. Electron. Comput. EC-13(6), 741-744, 1964. PDF

  • (J5) J. Brzozowski, W.A. Davis. On the Linearity of Autonomous Sequential Machines.
    IEEE Trans. Electron. Comput. EC-13(6), 673-679, 1964. PDF

  • (J4) J. Brzozowski. Derivatives of Regular Expressions.
    J. ACM 11 No. 4, 481-494, 1964. PDF

    CONFERENCES

  • (C4) W. A. Davis, J. A. Brzozowski. On the Linearity of Sequential Machines.
    Switching Circuit Theory and Logical Design.
    Princeton, NJ, November 11-13, 1964. IEEE, New York, NY, 197-208, 1964.
  • Go to the top of this document.


    1963

    JOURNALS

  • (J3) J. Brzozowski, J. F. Poage. On the Construction of Sequential Machines from Regular Expressions.
    IEEE Trans. Electron. Comput. EC-12(4), 402-403, 1963. PDF

  • (J2) J. Brzozowski, E. J. McCluskey. Signal Flow Graph Techniques for Sequential Circuit State Diagrams.
    IEEE Trans. Electron. Comput. EC-12(2), 67-76, 1963. PDF

    CONFERENCES

  • (C3) J. A. Brzozowski. Regular Expressions for Linear Sequential Circuits.
    First Allerton Conference on Circuit and System Theory.
    Monticello, IL, November 15-17, 1963. J. B. Cruz and J. C. Hofer, eds. University of Illinois, Urbana, IL 406-426, 1963.

  • Go to the top of this document.


    1962

    JOURNALS

  • (J1) J. A. Brzozowski. A Survey of Regular Expressions and Their Applications.
    IRE Trans. Electron. Comput. EC-11(3), 324-335, 1962. PDF

    CONFERENCES

  • (C2) S. Amarel, J. A. Brzozowski. Theoretical Considerations on Reliability Properties of Recursive Triangular Switching Networks.
    Redundancy Techniques for Computing Systems,
    Washington, DC., R. H. Wilcox, W. C. Mann, eds., Spartan Books, Washington, DC., 1962. 70-128, 1962.

  • (C1) J. A. Brzozowski. Canonical Regular Expressions and Minimal State Graphs for Definite Events.
    Mathematical Theory of Automata.
    New York, NY, April 24-26, 1962. J. Fox, ed., MRI Symposia Series, Vol. 12,
    Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, NY., 529-561, 1963. PDF

    PHD THESIS

  • J. A. Brzozowski. Regular Expression Techniques for Sequential Circuits.
    PhD Dissertation, Department of Electrical Engineering,
    Princeton University, Princeton, NJ, June 1962. PDF 27.8 MB

  • Go to the top of this document.


    Theses

  • Regular Expression Techniques for Sequential Circuits
    PhD Dissertation, Department of Electrical Engineering,
    Princeton University, Princeton, NJ, June 1962
    Thesis supervisor: E. J. McCluskey
    PDF 27.8 MB

  • Sensitivity of Transfer Matrices in Multivariable Control Systems
    MASc Thesis, Department of Electrical Engineering
    University of Toronto, Toronto, Ontario, March 1959
    Thesis supervisors: J. M. Ham and R. J. Kavanagh

    Books

  • J. A. Brzozowski and C-J. H. Seger
    Asynchronous Circuits
    Springer-Verlag, New York, NY, 1995

  • J. A. Brzozowski and M. Yoeli
    Digital Networks
    Prentice Hall, Englewood Cliffs, NJ, 1976

    Go to the top of this document.

    Go back to J. Brzozowski's home page.


    http://www.informatik.uni-freiburg.de/~drechsle/ismvl99/index.html "> 29th IEEE International Symposium on Multiple-Valued Logic,
    Freiburg, Germany, May 20 - 22, 1999.

    Go to the top of this document.

    Go back to J. Brzozowski's home page.