Publications by Janusz A. Brzozowski
Updated April 13, 2017
Click on the year.
2017
2016
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
Theses
Books
List of papers on
Asynchronous Circuit Theory
(pdf).
Last updated August 30, 2010
Go back to J. Brzozowski's home page .
 2017
JOURNALS

(J90) J. Brzozowski, C. Sinnamon.
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.
J. Autom. Lang. Comb.
To appear.

(J89) J. Brzozowski, C. Sinnamon.
Complexity of RightIdeal, PrefixClosed, and PrefixFree Regular Languages.
Acta Cybernet.
23(1), 941, 2017.

(J88) J. Brzozowski, M. Szykula.
Syntactic Complexity of SuffixFree Languages.
Inform. and Comput.
To appear.
CONFERENCES
 (C98) J. Brzozowski, S. Davies.
Most Complex NonReturning Regular Languages.
19th International Conference on Descriptional Complexity of Formal Systems.
DCFS 2017,
Milan, Italy, July 35, 2017.
To appear.
 (C97) J. Brzozowski, C. Sinnamon.
Complexity of Proper PrefixConvex Regular Languages.
22nd International Conference on Implementation and Application of Automata,
CIAA 2017,
MarnelaVallee, France, June 2730, 2017.
To appear.
 (C96) J. Brzozowski, C. Sinnamon.
Complexity of LeftIdeal, SuffixClosed and SuffixFree Regular Languages.
11th International Conference on Language and Automata Theory and Applications,
LATA 2017,
Umea, Sweden, March 69, 2017.
F. Drewes et al., eds,. LNCS 10168, 171182, 2016.
Go to the top of this document.
 2016
JOURNALS

(J87) J. Brzozowski, S. Davies, B. Y. V. Liu.
Most Complex Regular Ideal Languages.
Discrete Math. Theoret. Comput. Sci.
18(3), Paper #15, 25 pages, 2016.
pdf
CONFERENCES
 (C95) J. Brzozowski.
Towards a Theory of Complexity for Regular Languages.
20th International Conference on Developments in Language Theory,
DLT 2016,
Montreal, Canada, July 2528, 2016.
S. Brlek, C. Reutenauer, eds.,
Abstract in LNCS 9840, Invited Talk,
Slides pdf.
 (C94) J. Brzozowski, G. Jiraskova, B. Liu, A. Rajasekaran, M. Szykula.
On the State Complexity of the Shuffle of Regular Languages.
18th International Conference on Descriptional Complexity of Formal Systems,
DCFS 2016,
Bucharest, Romania, July 58, 2016.
C. Campeanu, F. Manea, J. Shalli, eds.,
LNCS 9777, 7386, 2016.
 (C93) J. Brzozowski.
Unrestricted State Complexity of Binary Operations on Regular Languages.
18th International Conference on Descriptional Complexity of Formal Systems,
DCFS 2016,
Bucharest, Romania, July 58, 2016.
C. Campeanu, F. Manea, J. Shalli, eds.,
LNCS 9777, 6072, 2016.
ARXIV
 J. Brzozowski, C. Sinnamon.
Complexity of PrefixConvex Regular Languages.
21 May 2016. Revised version posted 24 June 2016.
arXiv
 J. Brzozowski, G. Jiraskova, B. Liu, A. Rajasekaran, M. Szykula.
On the State Complexity of the Shuffle of Regular Languages.
Revised 25 February 2016.
arXiv
 J. Brzozowski.
True State Complexity of Binary Operations on Regular Languages.
February 2016.
Revised version posted under the title
Unrestricted State Complexity of Binary Operations on Regular Languages. June 2016.
arXiv
Go to the top of this document.
 2015
JOURNALS

(J86) J. Brzozowski, M. Szykula.
Large Aperiodic Semigroups.
Internat. J. Found. Comput. Sci.
26(7), 913931, 2015.

(J85) J. Brzozowski, S. Davies.
Quotient Complexities of Atoms in Regular Ideal Languages.
Acta Cybernet.
22(2), 293311, 2015.
pdf
Erratum: On p. 297, Definition 1, in the second bullet the intersection should be empty.
CONFERENCES

(C92) J. Brzozowski, M. Szykula.
Complexity of SuffixFree Regular Languages.
20th International Symposium on Fundamentals of Computation Theory,
FCT 2015,
Gdansk, Poland, August 1719, 2015,
A. Kosowski, I. Walukiewicz, eds.,
LNCS 9210, 146159, 2015.
pdf
Copyright SpringerVerlag GmbH Berlin Heidelberg. The final publication is available at
www.springerlink.com

(C91) J. Brzozowski, M. Szykula.
Upper Bound on Syntactic Complexity of SuffixFree Languages.
17th International Workshop on Descriptional Complexity of Formal Systems,
DCFS 2015,
Waterloo, ON, Canada, June 2527, 2015.
J. Shallit, A. Okhotin, eds.,
LNCS 9118, 3345, 2015.
pdf
Copyright SpringerVerlag GmbH Berlin Heidelberg. The final publication is available at
www.springerlink.com
ARXIV
 J. Brzozowski, G. Jiraskova, B. Liu, A. Rajasekaran, M. Szykula.
On the State Complexity of the Shuffle of Regular Languages.
3 December 2015.
arXiv
 J. Brzozowski, M. Szykula.
Complexity of SuffixFree Regular Languages.
18 November 2015.
arXiv
(Third revision)
 J. Brzozowski, S. Davies, B. Y. V. Liu.
Most Complex Regular Ideals.
31 October 2015.
arXiv
 J. Brzozowski, M. Szykula, Y. Ye.
Syntactic Complexity of Regular Ideals.
20 September 2015.
arXiv
Go to the top of this document.
 2014
JOURNALS

(J84) J. Brzozowski, B. Li.
Syntactic Complexity of R and JTrivial Languages.
Internat. J. Found. Comput. Sci.
25(7), 807821, 2014.

(J83) J. Brzozowski, G. Jiraskova, B. Li, J. Smith.
Quotient Complexity of Bifix, Factor, and SubwordFree Languages.
Acta Cybernet.
21(4), 505527, 2014.
pdf
(J82) J. Brzozowski, H. Tamm.
Theory of A'tomata.
Theoret. Comput. Sci.,
539, 1327, 2014.
(J81) J. Brzozowski, G. Jiraskova, C. Zou.
Quotient Complexity of Closed Languages.
Theory Comput. Syst.
54, 277292, 2014.
CONFERENCES
(C90) J. Brzozowski, M. Szykula.
Upper Bounds on Syntactic Complexity of Left and TwoSided Ideals.
18th International Conference on Developments in Language Theory,
DLT 2014,
Ekaterinburg, Russia, August 2629, 2014.
A. M. Shur, M. V. Volkov, eds.,
LNCS 8633, 1324, 2014.
Copyright SpringerVerlag GmbH Berlin Heidelberg. The final publication is available at
www.springerlink.com
(C89) J. Brzozowski, G. Davies.
Most Complex Regular RightIdeal Languages.
16th International Workshop on Descriptional Complexity of Formal Systems.,
DCFS 2014,
Turku, Finland, August 58, 2014.
H. Jurgensen et al., eds.,
LNCS 8614, 90101, 2014.
Copyright SpringerVerlag GmbH Berlin Heidelberg. The final 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 30August 2, 2014.
M. Holzer, M. Kutrib, eds.,
LNCS 8587, 124135, 2014.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The final 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 811, 2014.
J. Esparza et al., eds.,
LNCS 8573, 112, 2014.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The final 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 2729, 2014.
Z. Esik, Z. Fulop, eds.,
EPTCS 151, 2014. pp. 151161.
ARXIV
J. Brzozowski, M. Szykula.
Upper Bounds on Syntactic Complexity of Left and TwoSided 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 TwoSided 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), 10091027, 2013.

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

(J78) J. Brzozowski, G. Jiraskova, B. Li.
Quotient Complexity of Ideal Languages.
Theoret. Comput. Sci.,
470, 3652, 2013.
CONFERENCES

(C85) J. Brzozowski, B. Li.
Syntactic Complexities of R and JTrivial Regular Languages.
15th International Workshop on Descriptional Complexity of Formal Systems,
DCFS 2013,
London, ON, July 2225, 2013.
H. Jurgensen, R. Reis, eds.,
LNCS 8031, 160171, 2013.
Copyright SpringerVerlag 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 Concatenation Combined with Star.
15th International Workshop on Descriptional Complexity of Formal Systems,
DCFS 2013,
London, ON, July 2225, 2013.
H. Jurgensen, R. Reis, eds.,
LNCS 8031, 3041, 2013.
Copyright SpringerVerlag 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 1619, 2013.
S. Konstantinidis, ed.,
LNCS 7982, 7283, 2013.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The publication is available at www.springerlink.com
ARXIV

J. Brzozowski, G. Davies.
Most Complex Regular RightIdeal 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 JTrivial 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 StarFree Languages.
J. Autom. Lang. Comb.
17 (24), 83105, 2012.

(J76) J. Brzozowski, B. Liu.
Quotient Complexity of StarFree Languages.
Internat. J. Found. Comput. Sci.
23(6), 12611276, 2012.

(J75) J. Brzozowski, B. Li, Y. Ye.
Syntactic Complexity of Prefix, Suffix, Bifix, and FactorFree Regular Languages.
Theoret. Comput. Sci.
449, 3753, 2012.

(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), 2135, 2012.
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 1417, 2012.
H.C. Yen, O. H. Ibarra, eds.,
LNCS 7410, 5061,2012.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The publication is available at www.springerlink.com

(C81) J. Brzozowski, B. Li.
Syntactic Complexities of Some Classes of StarFree Languages.
14th International Workshop on Descriptional Complexity of Formal Systems,
DCFS 2012,
Braga, Portugal, July 2325, 2012.
M. Kutrib, N. Moreira, R. Reis, eds.,
LNCS 7386, 117129, 2012.
Copyright SpringerVerlag 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 1725, 2012.
N. Moreira, R. Reis, eds.,
LNCS 7381, 524, 2012.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The publication is available at www.springerlink.com
ERRATA:
1. The following reference should be added:
G. Liu, C. MartinVide, C. Salomaa, S. Yu.
State complexity of basic language operations combined with reversal,
Inform. and Comput. 206 (2008) 11781186.
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 JTrivial 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), 310321, 2011.

(J72) J. Brzozowski, J. Shallit, Z. Xu.
Decision Problems for Convex Languages.
Inform. and Comput.
209, 353367, 2011.
CONFERENCES

(C79) J. Brzozowski, B. Liu.
Quotient Complexity of StarFree Languages.
13th International Conference on Automata and Formal Languages,
AFL 2011,
Debrecen, Hungary, August 1722, 2011.
P. Domosi, I. Szabolcs, eds.,
Institute of Mathematics and Informatics,
College of Nyiregyhaza, Nyiregyhaza, Hungary, 138152, 2011.

(C78) J. Brzozowski, G. Jiraskova, B. Li, J. Smith.
Quotient Complexity of Bifix, Factor, and SubwordFree Regular Languages.
13th International Conference on Automata and Formal Languages,
AFL 2011,
Debrecen, Hungary, August 1722, 2011.
P. Domosi, I. Szabolcs, eds.,
Institute of Mathematics and Informatics,
College of Nyiregyhaza, Nyiregyhaza, Hungary, 123137, 2011.

(C77) J. Brzozowski, B. Li, Y. Ye.
Syntactic Complexity of Prefix, Suffix, and BifixFree Regular Languages.
13th International Workshop on Descriptional Complexity of Formal Systems,
DCFS 2011,
Limburg, Germany, July 2527, 2011.
M. Holzer, M. Kutrib, G. Pighizzini, eds.,
LNCS 6808, 93106, 2011.
Copyright SpringerVerlag 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 1922, 2011.
G. Mauri, A. Leporati, eds.,
LNCS 6795, 105116, 2011.
Copyright SpringerVerlag 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 1922, 2011.
G. Mauri, A. Leporati, eds.,
LNCS 6795, 117128, 2011.
Copyright SpringerVerlag 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 FactorFree Languages.
18 November 2011.
arXiv

J. Brzozowski, B. Li.
Syntactic Complexity of StarFree Languages.
15 September 2011.
arXiv

J. Brzozowski, G. Jiraskova, B. Li, J. Smith.
Quotient Complexity of Bifix, Factor, and SubwordFree Regular Languages.
Rerevised version with several new results.
11 May, 2011.
arxiv

J. Brzozowski, B. Li, Y. Ye.
Syntactic Complexity of Prefix, Suffix, and BifixFree 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), 7189, 2010.

(J70) J. Brzozowski, Y. Ye.
Gate Circuits with Feedback in Finite Multivalued Algebras of Transients.
J. Mult.Valued Logic Soft Comput.
16, 155176, 2010.
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 810, 2010.
I. McQuillan, G. Pighizzini, eds.,
Technical Report 201002,
Department of Computer Science, University of Saskatchewan, pp. 3849.
and

(C73) J. Brzozowski, G. Jiraskova, C. Zou.
Quotient Complexity of Closed Languages.
5th International Computer Science Symposium in Russia,
CSR 2010,
Kazan, Russia, June 1620, 2010.
F. Ablayev, E. W. Mayr, eds.,
LNCS 6072, 8495, 2010.
Copyright SpringerVerlag 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 2428, 2010.
A.H. Dediu, H. Fernau, C. MartinVide, eds.,
LNCS 6031, 115, 2010.
Copyright SpringerVerlag 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 1923, 2010.
A. LopezOrtiz, ed.,
LNCS 6034, 208221, 2010.
Copyright SpringerVerlag GmbH Berlin Heidelberg.
The publication is available at
www.springerlink.com
ARXIV

J. Brzozowski, B. Liu.
Quotient Complexity of StarFree Languages
17 December 2010.
arXiv

J. Brzozowski, G. Jiraskova, J. Smith.
Quotient Complexity of Bifix, Factor, and SubwordFree 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 SubwordFree 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, 445464, 2009.
Corrected version

(J68) J. Brzozowski, N. Santean.
Predictable Semiautomata.
Theoret. Comput. Sci.
410, 32363249, 2009.

(J67) J. Brzozowski, S. Konstantinidis.
State Complexity Hierarchies of Uniform Languages of AlphabetSize Length.
Theoret. Comput. Sci.
410, 32233235, 2009.
CONFERENCES

(C70) J. Brzozowski.
Quotient Complexity of Regular Languages.
Descriptional Complexity of Formal Systems, DCFS 2009
Magdeburg, Germany, July 69, 2009.
J. Dassow, G. Pighizzini, B. Truthe, eds.,
OttovonGuerickeUniversit"at Magdeburg, 2542, 2009.
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 30July 3, 2009.
V. Diekert, D. Nowotka, eds.,
LNCS 5583, 125144, 2009.
Copyright SpringerVerlag 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 28, 2009.
A. Dediu, A. Ionescu, C. MartinVide, eds.,
LNCS 5457, 247258, 2009.
Copyright SpringerVerlag 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 1618, 2008.
C. Campeanu, G. Pighizzini, eds.,
University of Prince Edward Island,
109120, 2008.

(C66) J. Brzozowski, S. Konstantinidis.
StateComplexity Hierarchies of Uniform Languages of AlphabetSize Length.
Descriptional Complexity of Formal Systems, DCFS 2008
Charlottetown, Prince Edward Island, July 1618, 2008.
C. Campeanu, G. Pighizzini, eds.,
University of Prince Edward Island,
97108, 2008.

(C65) T. Ang, J. Brzozowski.
Continuous Languages.
Automata and Formal Languages, AFL 2008
Balatonf"ured, Hungary, May 2730, 2008.
E. CsuhajVarju and Z. Esik, eds.,
Computer and Information Research Institute,
Hungarian Academy of Sciences,
7485, 2008.
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, 10651087, 2007.
CONFERENCES

(C64) J. Brzozowski, Y. Ye.
Simulation of Gate Circuits with Feedback in MultiValued Algebras.
International Symposium on MultipleValued Logic, ISMVL 2004
Oslo, Norway, May 1415, 2007.
IEEE Computer Society,
paper 46, 6 pp., 2007.
Go to the top of this document.
 2006
JOURNALS

(J65) Y. Ye. J. Brzozowski.
Covering of Transient Simulation of FeedbackFree Circuits by Binary Analysis.
Int. J. Found. Comput. Sci.
17, 949973, 2006.

(J64) J. Brzozowski.
Representation of a Class of Nondeterministic Semiautomata by Canonical Words.
Theoretical Computer Science
356, 4657, 2006.
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. MartinVide, and V. Mitrana, eds.,
Springer, 1142,
2006.
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, 831850, 2005.

(J62) J. Brzozowski, M. Gheorghiu.
Gate Circuits in the Algebra of Transients.
Theor. Inform. Appl.
39, 6791, 2005.
Go to the top of this document.
 2004
JOURNALS

(J61) J. Brzozowski.
Involuted Semilattices and Uncertainty in Ternary Algebras.
Internat. J. Algebra Comput.
14, 295310, 2004.
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, 114, 2004.
CONFERENCES

(C63) J. Brzozowski, H. Jurgensen.
Representation of Semiautomata by Canonical Words and Equivalences.
Descriptional Complexity of Formal Systems, DCFS 2004
London, ON, July 2628, 2004.
L. Ilie, D. Wotschke, eds.,
Report No. 619, Dept. of Computer Science,
University of Western Ontario, London, ON, Canada, 1327, 2004.
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, 377417, 2003.

(J59) M. Gheorghiu, J. Brzozowski.
Simulation of FeedbackFree Circuits in the Algebra of Transients.
Internat. J. Found. Comput. Sci.,
14, 10331054, 2003.

(J58) J. Brzozowski, Z. Esik.
Hazard Algebras.
Formal Methods System Design
23, 223256, 2003.

(J57) S. Silver, J. A. Brzozowski.
True Concurrency in Models of Asynchronous Circuit Behavior.
Formal Methods System Design
22, 183203, 2003.
BOOK CHAPTER
 J. Brzozowski, Z. Esik, Y. Iland.
Algebras for Hazard Detection.
In:
Beyond Two  Theory and Applications of MultipleValued Logic,
M. Fitting and E. Orlowska, eds.,
PhysicaVerlag, Heidelberg, 324, 2003.
(Reprinted from ISMVL 2001)
CONFERENCES
 (C62)
M. Gheorghiu, J. Brzozowski.
FeedbackFree Circuits in the Algebra of Transients.
Implementation and Application of Automata,
(Revised papers from CIAA 2002)
J.M. Champarnaud, D. Maurel, eds.,
LNCS 2608, 106116, 2003.
Copyright SpringerVerlag 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, 5766, 2003.
Copyright SpringerVerlag 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 SpecialPurpose Memories.
IEEE Transactions on ComputerAided Design,
21, 14591468, 2002.
CONFERENCES

(C60) M. Gheorghiu, J. Brzozowski.
FeedbackFree 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 69, 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, 525527, 2001.
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, 119, 2001.
CONFERENCES

(C57) J. A. Brzozowski, Z. Esik, and Y. Iland.
Algebras for Hazard Detection,
31st IEEE International Symposium on MultipleValued Logic, ISMVL 2001,
Warsaw, Poland, May 22  24, 2001.
IEEE Computer Society, 312, 2001.
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, 15651569, 2000.
JOURNALS

(J54) J. A. Brzozowski.
DelayInsensitivity and Ternary Simulation.
Theoret. Comput. Sci.
45, 325, 2000.

(J53) J. A. Brzozowski, R. Negulescu.
Automata of Asynchronous Behaviors.
Theoret. Comput. Sci.
231, 113128, 2000.

(J52) J. A. Brzozowski, H. Zhang.
DelayInsensitivity and SemiModularity.
Formal Methods in System Design,
16, 187214, 2000.
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 MultipleValued Logic, ISMVL 2000,
Portland, Oregon, May 23  25, 2000.
IEEE Computer Society, 173178, 2000.
Go to the top of this document.
 1999
JOURNALS

(J51) J. A. Brzozowski.
Some Applications of Ternary Algebras.
Publ. Math. Debrecen
54(supplement), 583589, 1999.

(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, 223243, 1999.
CONFERENCES

(C54) J. Lou, J. A. Brzozowski.
A Generalization of Shestakov's Function Decomposition Method.
International Symposium on MultipleValued Logic. Freiburg, Germany, May 2022, 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), 76115, 1998.

(J48) R. Negulescu, J. A. Brzozowski.
Relative Liveness: From Intuition to Automated Verification.
Formal Methods in Syst. Des.
12(1), 73115, 1998.
CONFERENCES

(C53) P. R. Sidorowicz, J. A. Brzozowski.
Verification of CAM Tests for Input Stuckat 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), 713721, 1997.

(J46) R. David, J. A. Brzozowski, H. Jurgensen.
Testing of Bounded Faults in RAMs.
J. Electron. Testing: Theory and Appl.
10(3), 197214, 1997.
CONFERENCES

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

(C50) J. A. Brzozowski.
DelayInsensitivity and Ternary Simulation.
First International Conference on
Semigroups and Algebraic Engineering.
AizuWakamatsu City, Japan, March 2428, 1997.

(C49) J. A. Brzozowski, J. J. Lou.
Blanket Algebra for MultipleValued Function Decomposition.
International Workshop on Formal Languages and Computer Systems.
Kyoto, Japan, March 1821, 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), 129142, 1996.
Erratum.
J. Electron. Testing: Theory and Appl.
14, 305306, 1999.

(J44) J. A. Brzozowski, H. Jurgensen.
Applications of Automata and Languages to Testing.
Publ. Math. Debrecen
48(34), 201215, 1996.
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 29September 1, 1995
IEEE Computer Society Press, Los Alamitos, CA
pp. 6774, 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 78, 1995.
IEEE Computer Society Press, Los Alamitos, CA,
pp. 123128, 1995.

(C45) J. A. Brzozowski, K. Raahemifar.
Testing CElements Is Not Elementary.
Second Working Conference on
Asynchronous Design Methodologies.
London, England, May 3031, 1995.
IEEE Computer Society Press, Los Alamitos, CA,
pp. 150159, 1995.

(C44) R. Negulescu, J. A. Brzozowski.
Relative Liveness: From Intuition to Automated Verification.
Second Working Conference on
Asynchronous Design Methodologies.
London, England, May 3031, 1995.
IEEE Computer Society Press, Los Alamitos, CA,
pp. 108117, 1995.
Go to the top of this document.
 1994
JOURNALS

(J43) CJ. Seger, J. A. Brzozowski.
Generalized Ternary Simulation of Sequential Circuits.
Theor. Inform. Appl.
28(34), 159186, 1994.
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. ComputerAided Design
12(12), 18131836, 1993.
CONFERENCES

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

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

(C41) J. A. Brzozowski.
Asynchronous Behaviours and FundamentalMode Realizations.
Seminar on
Automata Theory: Distributed Models.
Dagstuhl, Germany, January 1115, 1993.
Dagstuhl Seminar Report 54,
pp. 45, 1993.
Go to the top of this document.
 1992
JOURNALS

(J41) J. A. Brzozowski, J. C. Ebergen.
On the DelaySensitivity of Gate Networks.
IEEE Trans. Comput.
41(10), 13491360, 1992.

(J40) B. F. Cockburn, J. A. Brzozowski.
Near Optimal Tests for Classes of WriteTriggered Coupling Faults in RAMs.
J. Electron. Testing: Theory and Appl.
3(3), 251264, 1992.

(J39) J. A. Brzozowski, H. Jurgensen.
A Model for Sequential Machine Testing and Diagnosis.
J. Electron. Testing: Theory and Appl.
3(3), 219234, 1992.
CONFERENCES

(C40) J. A. Brzozowski, H. Jurgensen.
AutomatonTheoretic Considerations in Circuit Testing.
Second
Theoriedag.
Kiel, Germany, October 23, 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 710, 1992.
IEEE Computer Society Press, Los Alamitos, CA,
pp. 266271, 1992.

(C38) J. A. Brzozowski, H. Jurgensen.
Component Automata and RAM Faults.
Second International Colloquium on
Words, Languages and Combinatorics.
Kyoto, Japan, August 2528, 1992,
pp. 610, 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), 91107, 1991.
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), 151162, 1990.

(J36) B. F. Cockburn, J. A. Brzozowski.
SwitchLevel Testability of the Dynamic CMOS PLA.
Integration, The VLSI Journal
9(1), 4980, 1990.
CONFERENCES

(C37) B. F. Cockburn, J. A. Brzozowski.
NearOptimal 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.
NearOptimal Tests for Classes of Coupling Faults in RAMs.
Fifth Technical Workshop on
New Directions in IC Testing.
Ottawa, Ontario, August 12, 1991.
Go to the top of this document.
 1989
JOURNALS

(J35) J. A. Brzozowski, CJ. Seger.
A Unified Framework for Race Analysis of Asynchronous Networks.
J. ACM
36(1), 2045, 1989.
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 2125, 1989.
J. Csirik, J. Demetrovics, and F. Gecseg, eds.,
LNCS 380
SpringerVerlag, Berlin,
pp. 7894, 1989.
Go to the top of this document.
 1988
JOURNALS

(J34) CJ. Seger, J. A. Brzozowski.
An Optimistic Ternary Simulation of Gate Races.
Theoret. Comput. Sci.
66(1), 4966, 1988.
CONFERENCES

(C32) B. F. Cockburn, J. A. Brzozowski.
SwitchLevel Testability of the Dynamic CMOS PLA.
Third Technical Workshop on
New Directions in IC Testing.
Halifax, Nova Scotia, October 2627, 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 2627, 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 2627, 1988.

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

(C28) J. A. Brzozowski, H. Jurgensen.
Deterministic Diagnosis of Sequential Machines.
Second Conference on
Automata Languages and Programming Systems.
Salgotarjan, Hungary, May 2326, 1988.
F. Gecseg and I. Peak, eds.,
Department of Mathematics, Karl Marx University of Economics,
Budapest, Hungary.
pp. 3549, 1988.
Go to the top of this document.
 1987
JOURNALS

(J33) J. A. Brzozowski, CJ. Seger.
A Characterization of Ternary Simulation of Gate Networks.
IEEE Trans. Comput.
C36(11), 13181327, 1987.

(J32) J. A. Brzozowski, M. Yoeli.
Combinational Static CMOS Networks.
Integration, The VLSI Journal
5, 103122, 1987.
CONFERENCES

(C27) J. A. Brzozowski.
A Model for Sequential Machine Testing.
International Workshop on
New Directions in IC Testing.
Winnipeg, Manitoba, April 810, 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), 129147, 1986.
CONFERENCES

(C26) J. A. Brzozowski.
On the Testability of Static CMOS Latches.
Technical Digest of the
Canadian Conference on VLSI.
Montreal, Quebec, October 2728, 1986,
pp. 153158, 1986

(C25) CJ. Seger, J. A. Brzozowski.
An Optimistic Ternary Simulation of Gate Races.
Technical Digest of the
Canadian Conference on VLSI.
Montreal, Quebec, October 2728, 1986,
pp. 6772, 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 24, 1986.
In Congressus Numerantium, Vol. 56,
pp. 718, 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 1519, 1986.
L. Kott, ed.,
LNCS 226, 6978,
SpringerVerlag, Berlin,
1986.

(C22) J. A. Brzozowski, M. Yoeli.
Combinational Static CMOS Networks.
Aegean Workshop on Computing: VLSI Algorithms and Architectures.
Loutraki, Greece, July 811, 1986,
F. Makedon, K. Mehlhorn, T. Papatheodorou and P. Spirakis, eds.,
LNCS 227, 271282,
SpringerVerlag, 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 1820, 1986.
In Developments in Integrated Circuit Testing,
D. M. Miller, ed.,
Academic Press, New York, NY,
315357, 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), 387403, 1985.
CONFERENCES

(C20) J. A. Brzozowski and M. Sayed.
Design of Testable CMOS Cells.
Canadian Conference on VLSI.
Toronto, Ontario, November 45, 1985,
225228, 1985.

(C19) M. Yoeli and J. A. Brzozowski.
A Mathematical Model of Digital CMOS Networks.
Canadian Conference on VLSI.
Toronto, Ontario, November 45, 1985,
117120, 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, 153169, 1984.
Go to the top of this document.
1983
 I was chair of the department from 197883  no time for research.
Go to the top of this document.
1982
 I was chair of the department from 197883  no time for research.
Go to the top of this document.
1981
 I was chair of the department from 197883  no time for research.
Go to the top of this document.
 1980
JOURNALS

(J28) J. A. Brzozowski, F. E. Fich.
Languages of RTrivial Monoids.
J. Comput. System Sci.
20(1), 3249, 1980.

(J27) J. A. Brzozowski, E. Leiss.
On Equations for Regular Languages, Finite Automata, and Sequential Networks.
Theoret. Comput. Sci.
10, 1935, 1980.
CONFERENCES

(C18) J. A. Brzozowski.
Developments in the Theory of Regular Languages.
IFIP Congress 80.
Tokyo, Japan, October 69; Melbourne, Australia, October 1417, 1980.
S. Lavington, ed.,
North Holland, Amsterdam,
2940, 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), 178184, 1979.
CONFERENCES

(C17) J. A. Brzozowski.
Open Problems About Regular Languages.
Symposium on Formal Language Theory.
Santa Barbara, CA, December 1014, 1979.
In Formal Language Theory  Perspectives and Open Problems,
R. V. Book, ed.,
Academic Press, New York, NY,
pp. 2347, 1980.

(C16) F. E. Fich and J. A. Brzozowski.
A Characterization of a DotDepth Two Analogue of
Generalized Definite Languages.
Sixth International Colloquium on Automata, Languages and Programming.
Graz, Austria, July 1620, 1979.
H. Maurer, ed.,
LNCS 71,
SpringerVerlag, Berlin, 230244, 1979.
Go to the top of this document.
 1978
JOURNALS

(J25) J. A. Brzozowski, R. Knast.
The DotDepth Hierarchy of StarFree Languages is Infinite.
J. Comput. System Sci.
16(1), 3755, 1978.
Go to the top of this document.
 1977
JOURNALS

(J24) J. A. Brzozowski.
A Generalization of Finiteness.
Semigroup Forum
13(3), 239251, 1977.
Go to the top of this document.
 1976
JOURNALS

(J23) J. A. Brzozowski.
Run Languages.
Discrete Math.
16(4), 299307, 1976.

(J22) J. A. Brzozowski.
Hierarchies of Aperiodic Languages.
RAIRO
10(8), 3349, 1976.

(J21) J. A. Brzozowski, M. Yoeli.
Practical Approach to Asynchronous Gate Networks.
IEE Proc.
123(6), 495498, 1976.
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 MultipleValued Logic.
Bloomington, IN, May 1316, 1975. In Modern Uses of MultipleValued Logic.
J. M. Dunn and G. Epstein, eds.,
D. Reidel Publishing Company, Dordrecht, Holland,
3950, 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 1724, 1974,
A. Blikle, ed.,
LNCS 28,
SpringerVerlag, Berlin,
2632, 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), 243271, 1973.
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), 12811285, 1972.
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), 4153, 1971.

(J17) R. S. Cohen, J. A. Brzozowski.
Dot Depth of StarFree Events.
J. Comput. System Sc.
5(1), 116, 1971.
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 1518, 1971,
IEEE, New York, NY,
pp. 166176, 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), 260280, 1970.
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), 313320, 1969.

(J14) J. A. Brzozowski, R. S. Cohen.
On Decompositions of Regular Events.
J. ACM
16(1), 132144, 1969.
Go to the top of this document.
 1968
JOURNALS

(J13) J. A. Brzozowski, S. Singh.
Definite Asynchronous Sequential Circuits.
IEEE Trans. Comput.
C17(1), 1826, 1968.
CONFERENCES
(C12) J. A. Brzozowski.
RegularLike Expressions for Some Irregular Languages.
Ninth Annual Symposium on Switching and Automata Theory.
Schenectady, NY, October 1518, 1968,
IEEE, New York, NY,
278286, 1968.

(C11) R. Cohen and J. A. Brzozowski.
On StarFree Events.
Hawaii International Conference on System Sciences.
Honolulu, HI, January 2931, 1968,
B. K. Kinariwala and F. F. Kuo, eds.,
University of Hawaii Press, Honolulu, HI,
14, 1968.
Go to the top of this document.
 1967
JOURNALS

(J12) J. A. Brzozowski.
Roots of Star Events.
J. ACM
14(3), 466477, 1967.

(J11) J. A. Brzozowski.
On SingleLoop Realizations of Sequential Machines.
Information and Control
10(3), 292314, 1967.
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 1820, 1967,
IEEE, New York, NY,
pp. 265279, 1967.

(C9) J. A. Brzozowski and R. Cohen.
On Decompositions of Regular Events.
Eighth Annual Symposium on
Switching and Automata Theory.
Austin, TX, October 1820, 1967,
IEEE, New York, NY,
pp. 255264, 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.
COM14(2), 8593, 1966.

(J9) W. A. Davis, J. A. Brzozowski.
On the Linearity of Sequential Machines.
IEEE Trans. Electron. Comput.
EC15(1), 2129, 1966.
CONFERENCES

(C8) J. A. Brzozowski.
Roots of Star Events.
Switching Circuit Theory and Logical Design.
Berkeley, CA, October 2628, 1966,
IEEE, New York, NY,
8895, 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 2124, 1966.
IEEE, New York, NY,
paper CP 66101, 1966.
Go to the top of this document.
 1965
JOURNALS

(J8) J. A. Brzozowski.
Some Problems in Relay Circuit Design.
IEEE Trans. Electron. Comput.
EC14(4), 630634, 1965.

(J7) J. A. Brzozowski.
Regular Expressions for Linear Sequential Circuits.
IEEE Trans. Electron. Comput.
EC14(2), 148156, 1965.
CONFERENCES

(C6) J. A. Brzozowski.
On SingleLoop Realizations of Automata.
Switching Circuit Theory and Logical Design.
Ann Arbor, MI, October 68, 1965.
IEEE, New York, NY,
8493, 1965.

(C5) J. A. Brzozowski.
Synthesis of Sequential Machines.
Systems and Computer Science.
London, ON, September 1011, 1965.
J. F. Hart and S. Takasu, eds.,
University of Toronto Press, Toronto, ON,
1426, 1967.
Go to the top of this document.
 1964
JOURNALS

(J6) J. Brzozowski.
Regular Expressions from Sequential Circuits.
IEEE Trans. Electron. Comput.
EC13(6), 741744, 1964.

(J5) J. Brzozowski, W.A. Davis.
On the Linearity of Autonomous Sequential Machines.
IEEE Trans. Electron. Comput.
EC13(6), 673679, 1964.

(J4) J. Brzozowski.
Derivatives of Regular Expressions.
J. ACM
11 No. 4, 481494, 1964.
CONFERENCES

(C4) W. A. Davis, J. A. Brzozowski.
On the Linearity of Sequential Machines.
Switching Circuit Theory and Logical Design.
Princeton, NJ, November 1113, 1964.
IEEE, New York, NY,
197208, 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.
EC12(4), 402403, 1963.

(J2) J. Brzozowski, E. J. McCluskey.
Signal Flow Graph Techniques for Sequential Circuit State Diagrams.
IEEE Trans. Electron. Comput.
EC12(2), 6776, 1963.
CONFERENCES

(C3)
J. A. Brzozowski.
Regular Expressions for Linear Sequential Circuits.
First Allerton Conference on Circuit and System Theory.
Monticello, IL, November 1517, 1963.
J. B. Cruz and J. C. Hofer, eds.
University of Illinois, Urbana, IL
406426, 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.
EC11(3), 324335, 1962.
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. 70128, 1962.

(C1) J. A. Brzozowski.
Canonical Regular Expressions and Minimal
State Graphs for Definite Events.
Mathematical Theory of Automata.
New York, NY, April 2426, 1962. J. Fox, ed., MRI Symposia Series, Vol. 12,
Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, NY., 529561, 1963.
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
 Books

J. A. Brzozowski and CJ. H. Seger
Asynchronous Circuits
SpringerVerlag, 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.