Janusz Brzozowski | Academic Influence

Janusz Brzozowski 's AcademicInfluence.com Rankings

Janusz Brzozowski

Computer Science

#1816

World Rank

#1883

Historical Rank

Database

#2907

World Rank

#3032

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Janusz Brzozowski 's Degrees

PhD Computer Science University of Warsaw
Masters Mathematics University of Warsaw

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Janusz Brzozowski Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Janusz Antoni Brzozowski was a Polish-Canadian computer scientist and Distinguished Professor Emeritus at the University of Waterloo's David R. Cheriton School of Computer Science. In 1962, Brzozowski earned his PhD in the field of electrical engineering at Princeton University under Edward J. McCluskey. The topic of the thesis was Regular Expression Techniques for Sequential Circuits. From 1967 to 1996 he was Professor at the University of Waterloo. He is known for his contributions to mathematical logic, circuit theory, and automata theory.

(See a Problem?)

Janusz Brzozowski 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Derivatives of Regular Expressions (1964) (926)
Canonical regular expressions and minimal state graphs for definite events (1962) (323)
Characterizations of locally testable events (1971) (218)
On Equations for Regular Languages, Finite Automata, and Sequential Networks (1980) (175)
Dot-Depth of Star-Free Events (1971) (162)
The Dot-Depth Hierarchy of Star-Free Languages is Infinite (1978) (144)
Decomposition of Boolean Functions Specified by Cubes (2003) (111)
Signal Flow Graph Techniques for Sequential Circuit State Diagrams (1963) (97)
Quotient Complexity of Regular Languages (2009) (82)
Theory of átomata (2011) (70)
Review: B. G. Mirkin, An Algorithm for Constructing a Base in a Language of Regular Expressions (1971) (64)
Hierarchies of Aperiodic Languages (1976) (63)
In Search of Most Complex Regular Languages (2012) (62)
Languages of R-Trivial Monoids (1980) (60)
On the Delay-Sensitivity of Gate Networks (1992) (59)
OPEN PROBLEMS ABOUT REGULAR LANGUAGES (1980) (58)
Quotient complexity of ideal languages (2009) (58)
On a Ternary Model of Gate Networks (1979) (54)
Classification of Noncounting Events (1971) (50)
Syntactic Complexity of Ideal and Closed Languages (2010) (50)
A Survey of Regular Expressions and Their Applications (1962) (45)
Process spaces and formal verification of asynchronous circuits (1998) (44)
Asynchronous Circuits (1995) (40)
Quotient Complexity of Closed Languages (2009) (40)
Roots of Star Events (1966) (39)
Advances in asynchronous circuit theory. Part I : gate and unbounded inertial delay (1990) (33)
de Morgan bisemilattices (2000) (33)
Recent Developments in the Design of Asynchronous Circuits (1989) (32)
A model for sequential machine testing and diagnosis (1992) (31)
Algebras for hazard detection (2001) (31)
Consistency and satisfiability of waveform timing specifications (1991) (30)
Sign Detection in Residue Number Systems (1969) (30)
General Properties of Star Height of Regular Events (1970) (29)
Closures in Formal Languages and Kuratowski's Theorem (2009) (27)
Hazard Algebras (2003) (27)
On the State Complexity of the Shuffle of Regular Languages (2015) (26)
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (2011) (25)
Testing C-elements is not elementary (1995) (24)
Quotient Complexity of Star-Free Languages (2010) (23)
On Decompositions of Regular Events (1967) (23)
A Characterization of Ternary Simulation of Gate Networks (1987) (22)
Decision problems for convex languages (2008) (22)
Detection of coupling faults in RAMs (1990) (21)
Regular-Like Expressions for Some Irregular Languages (1968) (21)
Languages Convex with Respect to Binary Relations, and Their Closure Properties (2009) (21)
Quotient Complexities of Atoms of Regular Languages (2011) (21)
Design of Asynchronous Circuits (1995) (20)
Symmetric Groups and Quotient Complexity of Boolean Operations (2013) (19)
An approach to modeling and testing memories and its application to CAMs (1998) (19)
A unified framework for race analysis of asynchronous networks (1989) (18)
A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis (1999) (16)
Quotient Complexities of Atoms in Regular Ideal Languages (2015) (16)
On the Linearity of Autonomous Sequential Machines (1964) (15)
A Characterization of De Morgan Algebras (2001) (15)
Unrestricted State Complexity of Binary Operations on Regular Languages (2016) (15)
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages (2010) (15)
A Characterization of Finite Ternary Algebras (1997) (14)
On the Linearity of Sequential Machines (1964) (14)
On Translation Algorithms in Residue Number Systems (1972) (14)
Definite Asynchronous Sequential Circuits (1968) (14)
Blanket Algebra For Multiple-Valued Function Decomposition (1997) (13)
Representation of semiautomata by canonical words and equivalences (2005) (13)
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (2014) (13)
Combinational static CMOS networks (1987) (13)
Near-optimal tests for classes of write-triggered coupling faults in RAMs (1992) (12)
Complexity of suffix-free regular languages (2015) (12)
Most Complex Regular Ideal Languages (2015) (12)
Errata: "representation of Semiautomata by Canonical Words and Equivalences" (2005) (12)
Complexity in Convex Languages (2010) (12)
Delay-Insensitivity and Semi-Modularity (2000) (11)
Syntactic Complexity of Regular Ideals (2015) (11)
Regular Expressions for Linear Sequential Circuits (1965) (11)
Ternary Simulation of Binary Gate Networks (1977) (11)
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages (2016) (11)
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages (1979) (10)
Large Aperiodic Semigroups (2013) (10)
Simulation Of Feedback-Free Circuits In The Algebra Of Transients (2003) (10)
Generalized Ternary Simulation of Sequential Circuits (1994) (10)
Complexity of atoms of Regular Languages (2013) (9)
Syntactic Complexities of Six Classes of Star-Free Languages (2012) (9)
Representation of a class of nondeterministic semiautomata by canonical words (2006) (9)
Theory of Deterministic Trace-Assertion Specications ? (2004) (9)
Upper Bound on Syntactic Complexity of Suffix-Free Languages (2014) (8)
Syntactic Complexities of Some Classes of Star-Free Languages (2012) (8)
Complexity of Prefix-Convex Regular Languages (2016) (8)
Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages (2012) (8)
Random test length for bounded faults in RAMs (1993) (8)
Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules (2007) (8)
Maximally Atomic Languages (2013) (8)
Delay-insensitivity and ternary simulation (2000) (8)
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms (2013) (8)
Predictable semiautomata (2009) (8)
An Optimistic Ternary Simulation of Gate Races (1988) (7)
True Concurrency in Models of Asynchronous Circuit Behavior (2003) (7)
Gate circuits in the algebra of transients (2005) (7)
Complexity of Proper Prefix-Convex Regular Languages (2018) (7)
On generalized locally testable languages (1984) (7)
Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages (2012) (7)
State Complexity of Overlap Assembly (2017) (7)
On the Star Height of Regular Events (1967) (7)
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages (2017) (7)
An algebra of multiple faults in RAMs (1996) (6)
Relative Liveness: From Intuition to Automated Verification (1995) (6)
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis (2006) (6)
Regular Expressions from Sequential Circuits (1964) (6)
Continuous Languages (2008) (6)
Models for Analysis of Races in Sequential Networks (1974) (6)
Syntactic Complexity of - and -Trivial Regular Languages (2013) (6)
Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages (2010) (6)
May 26, 2013 12:31 WSPC/INSTRUCTION FILE brzozowski IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES (2013) (6)
A generalization of finiteness (1976) (6)
Developments in the Theory of regular Languages (1980) (6)
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (2016) (6)
Most Complex Regular Right-Ideal Languages (2013) (5)
Minimal Nondeterministic Finite Automata and Atoms of Regular Languages (2013) (5)
Efficient constrained encoding for VLSI sequential logic synthesis (1992) (5)
On the Construction of Sequential Machines from Regular Expressions (1963) (5)
A generalization of Shestakov's function decomposition method (1999) (5)
Switch-level testability of the dynamic CMOS PLA (1990) (5)
OntheLinearity ofSequential Machines (1966) (5)
Most Complex Non-returning Regular Languages (2017) (5)
Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary) (1986) (5)
Topics in Asynchronous Circuit Theory (2006) (4)
Simulation of gate circuits in the algebra of transients (2002) (4)
Automata of Asynchronous Behaviors (1997) (4)
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions (2010) (4)
Cluster-cover: a theoretical framework for a class of VLSI-CAD optimization problems (1998) (4)
On Single-Loop Realizations of Sequential Machines (1967) (4)
An Approximate Method for Computing Blocking Probability in Switching Networks (1966) (3)
Gate Circuits with Feedback in Finite Multivalued Algebras of Transients (2010) (3)
Most Complex Regular Ideals (2015) (3)
Feedback-free circuits in the algebra of transients (2002) (3)
Towards a Theory of Complexity of Regular Languages (2017) (3)
Syntactic Complexity of Star-Free Languages (2011) (3)
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length (2009) (3)
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star (2012) (3)
Involuted Semilattices and Uncertainty in Ternary Algebras (2004) (3)
State complexity of pattern matching in regular languages (2018) (2)
Closures in Formal Languages: Concatenation, Separation, and Algorithms (2009) (2)
31st IEEE International Symposium on Multiple-Valued Logic, May 22-24, 2001, Warsaw, Poland (2001) (2)
Syntactic complexity of suffix-free languages (2014) (2)
Testing for Bounded Faults in RAMs (1997) (2)
On single-loop realizations of automata (1965) (2)
Most Complex Deterministic Union-Free Regular Languages (2017) (2)
On serializability (2004) (2)
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages (2011) (2)
SignDetection inResidue Number Systems (1969) (2)
A framework for the analysis and design of algorithms for a class of VLSI-CAD optimization problems (1995) (2)
Simulation of Gate Circuits with Feedback in Multi-Valued Algebras (2007) (1)
OntheLinearity ofAutonomous Sequential Machines (1964) (1)
Semilattices of Fault Semiautomata (1999) (1)
Hazard Algebras (Extended Abstract) (2001) (1)
Practical approach to asynchronous gate networks (1976) (1)
Combinatorial Static CMOD Networks (Extended Summary) (1986) (1)
Sequential machine (2003) (1)
Composition of multiple faults in RAMs (1995) (1)
Combinational static ChJOS networks * (2004) (0)
Some Problems in Relay Circuit Design (1965) (0)
Gate Circuits with Feedback in Finite Algebras of Transients (2006) (0)
State Complexity of Pattern Matching in Finite Automata (2018) (0)
August 21, 2013 14:25 WSPC/INSTRUCTION FILE BrzozowskiTamm COMPLEXITY OF ATOMS OF REGULAR LANGUAGES (2013) (0)
Regular Languages and Finite Automata (1995) (0)
Quotient Complexity of Closed Languages (2013) (0)
CMOS Transistor Circuits (1995) (0)
On Equations for Regular (2001) (0)
Abstracts of Current Computer Literature (1963) (0)
Bi-Bounded Delay Models (1995) (0)
R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata (1970) (0)
Trace-Assertion Specifications of Deterministic Software Modules (0)
B. G. Mirkin. O ázyké psévdorégulárnyh vyrazénij (On a language of pseudo-regular expressions). Kibérnétika (Kiev), no. 6 (1966), pp. 8–11. (1969) (0)
Types of Behaviors (1995) (0)
Regular Expressions forLinear Sequential Circuits (1964) (0)
Duality for Three: Ternary Symmetry in Process Spaces (2004) (0)
ON SINGLE-LOOP REALI ZATIO NS OF AUTO MATA (1965) (0)
Testing C-Elements (1995) (0)
Determinism without Determinization (2008) (0)
Havel Ivan M.. Regular expressions over generalized alphabet and design of logical nets. Kybernetika (Prague), vol. 4 (1968), pp. 516–537. (1973) (0)
Review: M. A. Spivak, Algorithm for Abstract Synthesis of Automata for an Expanded Language of Regular Expressions (1972) (0)
Graph Congruences and Pair Testing (1986) (0)
Review: B. G. Mirkin, On a Language of Pseudo-Regular Expressions (1969) (0)
Workshop Reports (1966) (0)
Erratum to An Algebra of Multiple Faults in RAMs (1999) (0)
1964 Brzozowski and Davis : Linearity of Sequential lfachines 675 (2009) (0)
About Signal Flow Graph Techniques for Sequential Circuits (1964) (0)
CS – 2008 – 06 Continuous Languages (2008) (0)
Syntactic Complexity of Regular Ideals (2017) (0)
A framework for testing special-purpose memories (2002) (0)
Behaviors and Realizations (1995) (0)
b) Physicalische Chemie (1974) (0)
Review: Ivan M. Havel, Regular Expressions over Generalized Alphabet and Design of Logical Nets (1973) (0)
True State Complexity of Binary Operations on Regular Languages (2016) (0)
1 Topics in Asynchronous Circuit Theory ? (0)
RELIABILITY OF TRIANGULAR SWITCHING NETWORKS WITH INTERMITTENT FAILURES (1961) (0)
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages (2011) (0)
Up-Bounded-Delay Race Models (1995) (0)
normal waytofind theprime implicants andthrow awayanywhich cover strictly DON'T CAREentries. (1971) (0)
How to Avoid Nondeterminism with a Little Foresight (0)
Complexity of Race Analysis (1995) (0)
Book review - The principles of switching circuits (1974) (0)
About Feedback and SR Flip-Flops (1971) (0)
Limitations of Up-Bounded Delay Models (1995) (0)
State Complexity of Single-Word Pattern Matching in Regular Languages (2019) (0)
F L ] 2 J an 2 01 8 Most Complex Deterministic Union-Free Regular Languages ⋆ (2018) (0)
Minimization by reversal is not new (1989) (0)

This paper list is powered by the following services:

Other Resources About Janusz Brzozowski

en.wikipedia.org

What Schools Are Affiliated With Janusz Brzozowski ?

Janusz Brzozowski is affiliated with the following schools:

Image Attributions

Image Source for Janusz Brzozowski