A Survey of Regular Expressions and Their Applications. - Janusz A. Brzozowski (IRE Trans. Electron. Comput., 1962)

Signal Flow Graph Techniques for Sequential Circuit State Diagrams. - Janusz A. Brzozowski; Edward J. McCluskey (IEEE Trans. Electron. Comput., 1963)

On the Construction of Sequential Machines from Regular Expressions. - Janusz A. Brzozowski; J. F. Poage (IEEE Trans. Electron. Comput., 1963)

Derivatives of Regular Expressions. - Janusz A. Brzozowski (J. ACM, 1964)

Regular Expressions from Sequential Circuits. - Janusz A. Brzozowski (IEEE Trans. Electron. Comput., 1964)

On the Linearity of Autonomous Sequential Machines. - Janusz A. Brzozowski; Wayne A. Davis (IEEE Trans. Electron. Comput., 1964)

About Signal Flow Graph Techniques for Sequential Circuits. - Janusz A. Brzozowski; Edward J. McCluskey (IEEE Trans. Electron. Comput., 1964)

On single-loop realizations of automata - Janusz A. Brzozowski (SWCT, 1965)

Regular Expressions for Linear Sequential Circuits. - Janusz A. Brzozowski (IEEE Trans. Electron. Comput., 1965)

Some Problems in Relay Circuit Design. - Janusz A. Brzozowski (IEEE Trans. Electron. Comput., 1965)

On the Linearity of Sequential Machines. - Wayne A. Davis; Janusz A. Brzozowski (IEEE Trans. Electron. Comput., 1966)

On the Star Height of Regular Events - Rina S. Cohen; Janusz A. Brzozowski (SWAT, 1967)

Roots of Star Events. - Janusz A. Brzozowski (J. ACM, 1967)

On Single-Loop Realizations of Sequential Machines - Janusz A. Brzozowski (Inf. Control., 1967)

Regular-Like Expressions for Some Irregular Languages - Janusz A. Brzozowski (SWAT, 1968)

Definite Asynchronous Sequential Circuits. - Janusz A. Brzozowski; Shanker Singh (IEEE Trans. Computers, 1968)

On Decompositions of Regular Events. - Janusz A. Brzozowski; Rina S. Cohen (J. ACM, 1969)

Sign Detection in Residue Number Systems. - Dilip K. Banerji; Janusz A. Brzozowski (IEEE Trans. Computers, 1969)

General Properties of Star Height of Regular Events. - Rina S. Cohen; Janusz A. Brzozowski (J. Comput. Syst. Sci., 1970)

R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata. - Janusz A. Brzozowski (IEEE Trans. Computers, 1970)

Classification of Noncounting Events. - Janusz A. Brzozowski; Karel Culík II; Armen Gabrielian (J. Comput. Syst. Sci., 1971)

Dot-Depth of Star-Free Events. - Rina S. Cohen; Janusz A. Brzozowski (J. Comput. Syst. Sci., 1971)

About Feedback and SR Flip-Flops. - Janusz A. Brzozowski (IEEE Trans. Computers, 1971)

On Translation Algorithms in Residue Number Systems. - Dilip K. Banerji; Janusz A. Brzozowski (IEEE Trans. Computers, 1972)

Characterizations of locally testable events. - Janusz A. Brzozowski; Imre Simon (Discret. Math., 1973)

Models for Analysis of Races in Sequential Networks. - Janusz A. Brzozowski; Michael Yoeli (MFCS, 1974)

Run languages. - John A. Brzozowski (Discret. Math., 1976)

Hierarchies of Aperiodic Languages. - Janusz A. Brzozowski (RAIRO Theor. Informatics Appl., 1976)

The Dot-Depth Hierarchy of Star-Free Languages is Infinite. - Janusz A. Brzozowski; Robert Knast (J. Comput. Syst. Sci., 1978)

A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. - Faith E. Fich; Janusz A. Brzozowski (ICALP, 1979)

On a Ternary Model of Gate Networks. - Janusz A. Brzozowski; Michael Yoeli (IEEE Trans. Computers, 1979)

Developments in the Theory of regular Languages. - Janusz A. Brzozowski (IFIP Congress, 1980)

Languages of R-Trivial Monoids. - Janusz A. Brzozowski; Faith E. Fich (J. Comput. Syst. Sci., 1980)

On Equations for Regular Languages, Finite Automata, and Sequential Networks. - Janusz A. Brzozowski; Ernst L. Leiss (Theor. Comput. Sci., 1980)

On generalized locally testable languages. - Janusz A. Brzozowski; Faith E. Fich (Discret. Math., 1984)

On serializability. - Janusz A. Brzozowski; S. Muro (Int. J. Parallel Program., 1985)

Combinatorial Static CMOD Networks (Extended Summary). - Janusz A. Brzozowski; Michael Yoeli (Aegean Workshop on Computing, 1986)

Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary). - Janusz A. Brzozowski; Carl-Johan H. Seger (ICALP, 1986)

Graph Congruences and Pair Testing. - Janusz A. Brzozowski; Robert Knast (RAIRO Theor. Informatics Appl., 1986)

Combinational static CMOS networks. - Janusz A. Brzozowski; Michael Yoeli (Integr., 1987)

A Characterization of Ternary Simulation of Gate Networks. - Janusz A. Brzozowski; Carl-Johan H. Seger (IEEE Trans. Computers, 1987)

An Optimistic Ternary Simulation of Gate Races. - Carl-Johan H. Seger; Janusz A. Brzozowski (Theor. Comput. Sci., 1988)

Recent Developments in the Design of Asynchronous Circuits. - Janusz A. Brzozowski; Jo C. Ebergen (FCT, 1989)

Minimization by reversal is not new. - Janusz A. Brzozowski (Bull. EATCS, 1989)

A unified framework for race analysis of asynchronous networks. - Janusz A. Brzozowski; Carl-Johan H. Seger (J. ACM, 1989)

Detection of coupling faults in RAMs. - Janusz A. Brzozowski; Bruce F. Cockburn (J. Electron. Test., 1990)

Switch-level testability of the dynamic CMOS PLA. - Bruce F. Cockburn; Janusz A. Brzozowski (Integr., 1990)

Consistency and satisfiability of waveform timing specifications. - Janusz A. Brzozowski; T. Gahlinger; Farhad Mavaddat (Networks, 1991)

Efficient constrained encoding for VLSI sequential logic synthesis. - Chuanjin Richard Shi; Janusz A. Brzozowski (EURO-DAC, 1992)

A model for sequential machine testing and diagnosis. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1992)

Near-optimal tests for classes of write-triggered coupling faults in RAMs. - Bruce F. Cockburn; Janusz A. Brzozowski (J. Electron. Test., 1992)

On the Delay-Sensitivity of Gate Networks. - Janusz A. Brzozowski; Jo C. Ebergen (IEEE Trans. Computers, 1992)

Generalized Ternary Simulation of Sequential Circuits. - Carl-Johan H. Seger; Janusz A. Brzozowski (RAIRO Theor. Informatics Appl., 1994)

Asynchronous Circuits. - Janusz A. Brzozowski; Carl-Johan H. Seger (Springer, 1995)

A framework for the analysis and design of algorithms for a class of VLSI-CAD optimization problems. - Chuanjin Richard Shi; Janusz A. Brzozowski (ASP-DAC, 1995)

Testing C-elements is not elementary. - Janusz A. Brzozowski; Kaamran Raahemifar (ASYNC, 1995)

An algebra of multiple faults in RAMs. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1996)

Testing for Bounded Faults in RAMs. - René David; Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1997)

A Characterization of Finite Ternary Algebras. - Janusz A. Brzozowski; J. J. Lou; Radu Negulescu (Int. J. Algebra Comput., 1997)

An Approach to Modeling and Testing Memories and Its Application to CAMs. - Piotr R. Sidorowicz; Janusz A. Brzozowski (VTS, 1998)

Relative Liveness: From Intuition to Automated Verification. - Radu Negulescu; Janusz A. Brzozowski (Formal Methods Syst. Des., 1998)

Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems. - Chuanjin Richard Shi; Janusz A. Brzozowski (ACM Trans. Design Autom. Electr. Syst., 1998)

Semilattices of Fault Semiautomata. - Janusz A. Brzozowski; Helmut Jürgensen (Jewels are Forever, 1999)

A Generalization of Shestakov's Function Decomposition Method. - J. J. Lou; Janusz A. Brzozowski (ISMVL, 1999)

A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis. - Chuanjin Richard Shi; Janusz A. Brzozowski (Discret. Appl. Math., 1999)

Erratum to An Algebra of Multiple Faults in RAMs. - Janusz A. Brzozowski; Helmut Jürgensen (J. Electron. Test., 1999)

Hazard Algebras (Extended Abstract). - Janusz A. Brzozowski; Zoltán Ésik (A Half-Century of Automata Theory, 2000)

De Morgan Bisemilattices. - Janusz A. Brzozowski (ISMVL, 2000)

Delay-Insensitivity and Semi-Modularity. - Janusz A. Brzozowski; Hao Zhang 002 (Formal Methods Syst. Des., 2000)

Delay-insensitivity and ternary simulation. - Janusz A. Brzozowski (Theor. Comput. Sci., 2000)

Automata of Asynchronous Behaviors. - Janusz A. Brzozowski; Radu Negulescu (Theor. Comput. Sci., 2000)

Algebras for Hazard Detection. - Janusz A. Brzozowski; Zoltán Ésik; Y. Iland (ISMVL, 2001)

A Characterization of De Morgan Algebras. - Janusz A. Brzozowski (Int. J. Algebra Comput., 2001)

Simulation of Gate Circuits in the Algebra of Transients. - Janusz A. Brzozowski; Mihaela Gheorghiu (CIAA, 2002)

Feedback-Free Circuits in the Algebra of Transients. - Mihaela Gheorghiu; Janusz A. Brzozowski (CIAA, 2002)

A framework for testing special-purpose memories. - Piotr R. Sidorowicz; Janusz A. Brzozowski (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002)

Hazard Algebras. - Janusz A. Brzozowski; Zoltán Ésik (Formal Methods Syst. Des., 2003)

True Concurrency in Models of Asynchronous Circuit Behavior. - Signe J. Silver; Janusz A. Brzozowski (Formal Methods Syst. Des., 2003)

Simulation Of Feedback-Free Circuits In The Algebra Of Transients. - Mihaela Gheorghiu; Janusz A. Brzozowski (Int. J. Found. Comput. Sci., 2003)

Decomposition of Boolean Functions Specified by Cubes. - Janusz A. Brzozowski; Tadeusz Luba (J. Multiple Valued Log. Soft Comput., 2003)

Duality for Three: Ternary Symmetry in Process Spaces. - Janusz A. Brzozowski; Radu Negulescu (Theory Is Forever, 2004)

Involuted Semilattices and Uncertainty in Ternary Algebras. - Janusz A. Brzozowski (Int. J. Algebra Comput., 2004)

Representation of semiautomata by canonical words and equivalences. - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2005)

Gate circuits in the algebra of transients. - Janusz A. Brzozowski; Mihaela Gheorghiu (RAIRO Theor. Informatics Appl., 2005)

Errata: "representation of Semiautomata by Canonical Words and Equivalences". - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2006)

Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis. - Yuli Ye; Janusz A. Brzozowski (Int. J. Found. Comput. Sci., 2006)

Representation of a class of nondeterministic semiautomata by canonical words. - Janusz A. Brzozowski (Theor. Comput. Sci., 2006)

Topics in Asynchronous Circuit Theory. - Janusz A. Brzozowski (Recent Advances in Formal Languages and Applications, 2006)

Simulation of Gate Circuits with Feedback in Multi-Valued Algebras. - Janusz A. Brzozowski; Yuli Ye (ISMVL, 2007)

Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules. - Janusz A. Brzozowski; Helmut Jürgensen (Int. J. Found. Comput. Sci., 2007)

Continuous Languages. - Thomas Ang; Janusz A. Brzozowski (AFL, 2008)

Determinism without Determinization. - Janusz A. Brzozowski; Nicolae Santean (DCFS, 2008)

Languages Convex with Respect to Binary Relations, and Their Closure Properties. - Thomas Ang; Janusz A. Brzozowski (Acta Cybern., 2009)

Closures in Formal Languages: Concatenation, Separation, and Algorithms - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (CoRR, 2009)

Quotient Complexity of Regular Languages - Janusz A. Brzozowski (DCFS, 2009)

State-complexity hierarchies of uniform languages of alphabet-size length. - Janusz A. Brzozowski; Stavros Konstantinidis (Theor. Comput. Sci., 2009)

Predictable semiautomata. - Janusz A. Brzozowski; Nicolae Santean (Theor. Comput. Sci., 2009)

Complexity in Convex Languages. - Janusz A. Brzozowski (LATA, 2010)

Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages - Janusz A. Brzozowski; Galina Jirásková; Joshua Smith 001 (CoRR, 2010)

Gate Circuits with Feedback in Finite Multivalued Algebras of Transients. - Janusz A. Brzozowski; Yuli Ye (J. Multiple Valued Log. Soft Comput., 2010)

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. - Janusz A. Brzozowski; Baiyu Li; Yuli Ye (DCFS, 2011)

Syntactic Complexity of Ideal and Closed Languages. - Janusz A. Brzozowski; Yuli Ye (Developments in Language Theory, 2011)

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages - Janusz A. Brzozowski; Baiyu Li; Yuli Ye (CoRR, 2011)

Syntactic Complexity of Star-Free Languages - Janusz A. Brzozowski; Baiyu Li (CoRR, 2011)

Decision problems for convex languages. - Janusz A. Brzozowski; Jeffrey O. Shallit; Zhi Xu 002 (Inf. Comput., 2011)

Closures in Formal Languages and Kuratowski's Theorem. - Janusz A. Brzozowski; Elyot Grant; Jeffrey O. Shallit (Int. J. Found. Comput. Sci., 2011)

Syntactic Complexities of Some Classes of Star-Free Languages. - Janusz A. Brzozowski; Baiyu Li (DCFS, 2012)

Quotient Complexities of Atoms of Regular Languages. - Janusz A. Brzozowski; Hellis Tamm (Developments in Language Theory, 2012)

Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages - Janusz A. Brzozowski; David Liu 003 (CoRR, 2012)

Syntactic Complexity of R- and J-Trivial Regular Languages - Janusz A. Brzozowski; Baiyu Li (CoRR, 2012)

Quotient Complexity of Star-Free Languages. - Janusz A. Brzozowski; Bo Liu 092 (Int. J. Found. Comput. Sci., 2012)

On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. - Janusz A. Brzozowski; Baiyu Li; Yuli Ye (Int. J. Found. Comput. Sci., 2012)

Syntactic Complexities of Six Classes of Star-Free Languages. - Janusz A. Brzozowski; Baiyu Li; David Liu 003 (J. Autom. Lang. Comb., 2012)

Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. - Janusz A. Brzozowski; Baiyu Li; Yuli Ye (Theor. Comput. Sci., 2012)

Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star. - Janusz A. Brzozowski; David Liu 003 (DCFS, 2013)

Syntactic Complexity of - and -Trivial Regular Languages. - Janusz A. Brzozowski; Baiyu Li (DCFS, 2013)

Universal Witnesses for State Complexity of Basic Operations Combined with Reversal. - Janusz A. Brzozowski; David Liu 003 (CIAA, 2013)

Minimal Nondeterministic Finite Automata and Atoms of Regular Languages - Janusz A. Brzozowski; Hellis Tamm (CoRR, 2013)

Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms - Janusz A. Brzozowski; Gareth Davies 001 (CoRR, 2013)

In Search of Most Complex Regular Languages. - Janusz A. Brzozowski (Int. J. Found. Comput. Sci., 2013)

Complexity of atoms of Regular Languages. - Janusz A. Brzozowski; Hellis Tamm (Int. J. Found. Comput. Sci., 2013)

Quotient complexity of ideal languages. - Janusz A. Brzozowski; Galina Jirásková; Baiyu Li (Theor. Comput. Sci., 2013)

Most Complex Regular Right-Ideal Languages. - Janusz A. Brzozowski; Gareth Davies 001 (DCFS, 2014)

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. - Janusz A. Brzozowski; Marek Szykula (Developments in Language Theory, 2014)

Symmetric Groups and Quotient Complexity of Boolean Operations. - Jason P. Bell; Janusz A. Brzozowski; Nelma Moreira; Rogério Reis (ICALP (2), 2014)

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages. - Janusz A. Brzozowski; Galina Jirásková; Baiyu Li; Joshua Smith 001 (Acta Cybern., 2014)

Maximally Atomic Languages. - Janusz A. Brzozowski; Gareth Davies 001 (AFL, 2014)

Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages. - Janusz A. Brzozowski; Baiyu Li (Int. J. Found. Comput. Sci., 2014)

Quotient Complexity of Closed Languages. - Janusz A. Brzozowski; Galina Jirásková; Chenglong Zou (Theory Comput. Syst., 2014)

Theory of átomata. - Janusz A. Brzozowski; Hellis Tamm (Theor. Comput. Sci., 2014)

A scalable architecture for performance measurement in broadband networks. - Sarvesh S. Kulkarni; Eduard Bachmakov; Edward Gallagher; Vijay Gehlot; Andrew Dammann; Peter Rokowski; John Brzozowski (CSCN, 2015)

Upper Bound on Syntactic Complexity of Suffix-Free Languages. - Janusz A. Brzozowski; Marek Szykula (DCFS, 2015)

Quotient Complexities of Atoms in Regular Ideal Languages. - Janusz A. Brzozowski; Sylvie Davies (Acta Cybern., 2015)

Most Complex Regular Ideals. - Janusz A. Brzozowski; Sylvie Davies; Bo Yang Victor Liu (CoRR, 2015)

Large Aperiodic Semigroups. - Janusz A. Brzozowski; Marek Szykula (Int. J. Found. Comput. Sci., 2015)

Unrestricted State Complexity of Binary Operations on Regular Languages. - Janusz A. Brzozowski (DCFS, 2016)

On the State Complexity of the Shuffle of Regular Languages. - Janusz A. Brzozowski; Galina Jirásková; Bo Liu 092; Aayush Rajasekaran; Marek Szykula (DCFS, 2016)

Modeling and performance simulation of a software architecture for large-scale measurement of broadband networks using colored petri nets. - Vijay Gehlot; Sarvesh S. Kulkarni; John Brzozowski (SpringSim (CNS), 2016)

True State Complexity of Binary Operations on Regular Languages. - Janusz A. Brzozowski (CoRR, 2016)

Complexity of Prefix-Convex Regular Languages. - Janusz A. Brzozowski; Corwin Sinnamon (CoRR, 2016)

Most Complex Regular Ideal Languages. - Janusz A. Brzozowski; Sylvie Davies; Bo Yang Victor Liu (Discret. Math. Theor. Comput. Sci., 2016)

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. - Janusz A. Brzozowski; Corwin Sinnamon (LATA, 2017)

Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages. - Janusz A. Brzozowski; Corwin Sinnamon (Acta Cybern., 2017)

Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages. - Janusz A. Brzozowski; Corwin Sinnamon (J. Autom. Lang. Comb., 2017)

Complexity of suffix-free regular languages. - Janusz A. Brzozowski; Marek Szykula (J. Comput. Syst. Sci., 2017)

Most Complex Deterministic Union-Free Regular Languages. - Janusz A. Brzozowski; Sylvie Davies (DCFS, 2018)

State Complexity of Pattern Matching in Finite Automata. - Janusz A. Brzozowski; Sylvie Davies; Abhishek Madan (CoRR, 2018)

Syntactic complexity of suffix-free languages. - Janusz A. Brzozowski; Marek Szykula (Inf. Comput., 2018)

Towards a Theory of Complexity of Regular Languages. - Janusz A. Brzozowski (J. Autom. Lang. Comb., 2018)

Syntactic Complexity of Regular Ideals. - Janusz A. Brzozowski; Marek Szykula; Yuli Ye (Theory Comput. Syst., 2018)

Use Cases for IPv6 Source Packet Routing in Networking (SPRING). - John Brzozowski; John Leddy; Clarence Filsfils; Roberta Maglione; Mark Townsley (RFC, 2018)

State Complexity of Single-Word Pattern Matching in Regular Languages. - Janusz A. Brzozowski; Sylvie Davies; Abhishek Madan (DCFS, 2019)

Most Complex Non-Returning Regular Languages. - Janusz A. Brzozowski; Sylvie Davies (Int. J. Found. Comput. Sci., 2019)

State complexity of pattern matching in regular languages. - Janusz A. Brzozowski; Sylvie Davies; Abhishek Madan (Theor. Comput. Sci., 2019)

Complexity of proper prefix-convex regular languages. - Janusz A. Brzozowski; Corwin Sinnamon (Theor. Comput. Sci., 2019)

State Complexity of Overlap Assembly. - Janusz A. Brzozowski; Lila Kari; Bai Li; Marek Szykula (Int. J. Found. Comput. Sci., 2020)