default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanusz A. Brzozowski
John A. Brzozowski – John Brzozowski
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j97]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula
:
State Complexity of Overlap Assembly. Int. J. Found. Comput. Sci. 31(8): 1113-1132 (2020)
2010 – 2019
- 2019
- [j96]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-Returning Regular Languages. Int. J. Found. Comput. Sci. 30(6-7): 921-957 (2019) - [j95]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State complexity of pattern matching in regular languages. Theor. Comput. Sci. 777: 121-131 (2019) - [j94]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of proper prefix-convex regular languages. Theor. Comput. Sci. 787: 2-13 (2019) - [c66]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Single-Word Pattern Matching in Regular Languages. DCFS 2019: 86-97 - 2018
- [j93]Janusz A. Brzozowski, Marek Szykula:
Syntactic complexity of suffix-free languages. Inf. Comput. 259(2): 174-190 (2018) - [j92]Janusz A. Brzozowski:
Towards a Theory of Complexity of Regular Languages. J. Autom. Lang. Comb. 23(1-3): 67-101 (2018) - [j91]Janusz A. Brzozowski, Marek Szykula, Yuli Ye:
Syntactic Complexity of Regular Ideals. Theory Comput. Syst. 62(5): 1175-1202 (2018) - [c65]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. DCFS 2018: 37-48 - [c64]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CIAA 2018: 109-120 - [i38]Janusz A. Brzozowski, Sylvie Davies, Abhishek Madan:
State Complexity of Pattern Matching in Finite Automata. CoRR abs/1806.04645 (2018) - [i37]John Brzozowski, John Leddy, Clarence Filsfils, Roberta Maglione, Mark Townsley:
Use Cases for IPv6 Source Packet Routing in Networking (SPRING). RFC 8354: 1-9 (2018) - 2017
- [j90]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages. Acta Cybern. 23(1): 9-41 (2017) - [j89]Janusz A. Brzozowski, Corwin Sinnamon:
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages. J. Autom. Lang. Comb. 22(1-3): 29-59 (2017) - [j88]Janusz A. Brzozowski, Marek Szykula:
Complexity of suffix-free regular languages. J. Comput. Syst. Sci. 89: 270-287 (2017) - [c63]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-returning Regular Languages. DCFS 2017: 89-101 - [c62]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. LATA 2017: 171-182 - [c61]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Proper Prefix-Convex Regular Languages. CIAA 2017: 52-63 - [i36]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Non-Returning Regular Languages. CoRR abs/1701.03944 (2017) - [i35]Janusz A. Brzozowski:
Towards a Theory of Complexity of Regular Languages. CoRR abs/1702.05024 (2017) - [i34]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CoRR abs/1710.06000 (2017) - [i33]Janusz A. Brzozowski, Sylvie Davies:
Most Complex Deterministic Union-Free Regular Languages. CoRR abs/1711.09149 (2017) - 2016
- [j87]Janusz A. Brzozowski, Sylvie Davies, Bo Yang Victor Liu:
Most Complex Regular Ideal Languages. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [c60]Janusz A. Brzozowski:
Unrestricted State Complexity of Binary Operations on Regular Languages. DCFS 2016: 60-72 - [c59]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. DCFS 2016: 73-86 - [c58]Vijay Gehlot, Sarvesh S. Kulkarni, John Brzozowski:
Modeling and performance simulation of a software architecture for large-scale measurement of broadband networks using colored petri nets. SpringSim (CNS) 2016: 4 - [i32]Janusz A. Brzozowski:
True State Complexity of Binary Operations on Regular Languages. CoRR abs/1602.01387 (2016) - [i31]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Prefix-Convex Regular Languages. CoRR abs/1605.06697 (2016) - [i30]Janusz A. Brzozowski, Corwin Sinnamon:
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages. CoRR abs/1609.04439 (2016) - [i29]Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. CoRR abs/1610.00728 (2016) - 2015
- [j86]Janusz A. Brzozowski, Sylvie Davies:
Quotient Complexities of Atoms in Regular Ideal Languages. Acta Cybern. 22(2): 293-311 (2015) - [j85]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. Int. J. Found. Comput. Sci. 26(7): 913-932 (2015) - [c57]Sarvesh S. Kulkarni, Eduard Bachmakov, Edward Gallagher, Vijay Gehlot, Andrew Dammann, Peter Rokowski, John Brzozowski:
A scalable architecture for performance measurement in broadband networks. CSCN 2015: 174-180 - [c56]Janusz A. Brzozowski, Marek Szykula:
Upper Bound on Syntactic Complexity of Suffix-Free Languages. DCFS 2015: 33-45 - [c55]Janusz A. Brzozowski, Marek Szykula:
Complexity of Suffix-Free Regular Languages. FCT 2015: 146-159 - [i28]Janusz A. Brzozowski, Sylvie Davies:
Quotient Complexities of Atoms in Regular Ideal Languages. CoRR abs/1503.02208 (2015) - [i27]Janusz A. Brzozowski, Marek Szykula:
Complexity of Suffix-Free Regular Languages. CoRR abs/1504.05159 (2015) - [i26]Janusz A. Brzozowski, Marek Szykula, Yuli Ye:
Syntactic Complexity of Regular Ideals. CoRR abs/1509.06032 (2015) - [i25]Janusz A. Brzozowski, Sylvie Davies, Bo Yang Victor Liu:
Most Complex Regular Ideals. CoRR abs/1511.00157 (2015) - [i24]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. CoRR abs/1512.01187 (2015) - 2014
- [j84]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages. Acta Cybern. 21(4): 507-527 (2014) - [j83]Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages. Int. J. Found. Comput. Sci. 25(7): 807-822 (2014) - [j82]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. Theory Comput. Syst. 54(2): 277-292 (2014) - [j81]Janusz A. Brzozowski, Hellis Tamm:
Theory of átomata. Theor. Comput. Sci. 539: 13-27 (2014) - [c54]Janusz A. Brzozowski, Gareth Davies:
Most Complex Regular Right-Ideal Languages. DCFS 2014: 90-101 - [c53]Janusz A. Brzozowski, Marek Szykula:
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. Developments in Language Theory 2014: 13-24 - [c52]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) 2014: 1-12 - [c51]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. CIAA 2014: 124-135 - [c50]Janusz A. Brzozowski, Gareth Davies:
Maximally Atomic Languages. AFL 2014: 151-161 - [i23]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. CoRR abs/1401.0157 (2014) - [i22]Janusz A. Brzozowski, Marek Szykula:
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. CoRR abs/1403.2090 (2014) - [i21]Janusz A. Brzozowski, Marek Szykula:
Upper Bound on Syntactic Complexity of Suffix-Free Languages. CoRR abs/1412.2281 (2014) - 2013
- [j80]Janusz A. Brzozowski:
In Search of Most Complex Regular Languages. Int. J. Found. Comput. Sci. 24(6): 691-708 (2013) - [j79]Janusz A. Brzozowski, Hellis Tamm:
Complexity of atoms of Regular Languages. Int. J. Found. Comput. Sci. 24(7): 1009-1028 (2013) - [j78]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient complexity of ideal languages. Theor. Comput. Sci. 470: 36-52 (2013) - [c49]Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star. DCFS 2013: 30-41 - [c48]Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of - and -Trivial Regular Languages. DCFS 2013: 160-171 - [c47]Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal. CIAA 2013: 72-83 - [i20]Janusz A. Brzozowski, Hellis Tamm:
Minimal Nondeterministic Finite Automata and Atoms of Regular Languages. CoRR abs/1301.5585 (2013) - [i19]Janusz A. Brzozowski, Gareth Davies:
Maximal Syntactic Complexity of Regular Languages Implies Maximal Quotient Complexities of Atoms. CoRR abs/1302.3906 (2013) - [i18]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. CoRR abs/1310.1841 (2013) - [i17]Janusz A. Brzozowski, Gareth Davies:
Most Complex Regular Right-Ideal Languages. CoRR abs/1311.4448 (2013) - 2012
- [j77]Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. Int. J. Found. Comput. Sci. 23(1): 21-35 (2012) - [j76]Janusz A. Brzozowski, Bo Liu:
Quotient Complexity of Star-Free Languages. Int. J. Found. Comput. Sci. 23(6): 1261-1276 (2012) - [j75]Janusz A. Brzozowski, Baiyu Li, David Liu:
Syntactic Complexities of Six Classes of Star-Free Languages. J. Autom. Lang. Comb. 17(2-4): 83-105 (2012) - [j74]Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theor. Comput. Sci. 449: 37-53 (2012) - [c46]Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexities of Some Classes of Star-Free Languages. DCFS 2012: 117-129 - [c45]Janusz A. Brzozowski, Hellis Tamm:
Quotient Complexities of Atoms of Regular Languages. Developments in Language Theory 2012: 50-61 - [c44]Janusz A. Brzozowski:
In Search of Most Complex Regular Languages. CIAA 2012: 5-24 - [i16]Janusz A. Brzozowski, Hellis Tamm:
Quotient Complexities of Atoms of Regular Languages. CoRR abs/1201.0295 (2012) - [i15]Janusz A. Brzozowski, David Liu:
Syntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages. CoRR abs/1203.2873 (2012) - [i14]Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal. CoRR abs/1207.0535 (2012) - [i13]Janusz A. Brzozowski, David Liu:
Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star. CoRR abs/1207.1982 (2012) - [i12]Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of R- and J-Trivial Regular Languages. CoRR abs/1208.4650 (2012) - 2011
- [j73]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision problems for convex languages. Inf. Comput. 209(3): 353-367 (2011) - [j72]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Int. J. Found. Comput. Sci. 22(2): 301-321 (2011) - [c43]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages. AFL 2011: 123-137 - [c42]Janusz A. Brzozowski, Bo Liu:
Quotient Complexity of Star-Free Languages. AFL 2011: 138-152 - [c41]Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages. DCFS 2011: 93-106 - [c40]Janusz A. Brzozowski, Hellis Tamm:
Theory of Átomata. Developments in Language Theory 2011: 105-116 - [c39]Janusz A. Brzozowski, Yuli Ye:
Syntactic Complexity of Ideal and Closed Languages. Developments in Language Theory 2011: 117-128 - [i11]Janusz A. Brzozowski, Hellis Tamm:
Theory of Atomata. CoRR abs/1102.3901 (2011) - [i10]Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages. CoRR abs/1103.2986 (2011) - [i9]Janusz A. Brzozowski, Baiyu Li:
Syntactic Complexity of Star-Free Languages. CoRR abs/1109.3381 (2011) - 2010
- [j71]Janusz A. Brzozowski:
Quotient Complexity of Regular Languages. J. Autom. Lang. Comb. 15(1/2): 71-89 (2010) - [j70]Janusz A. Brzozowski, Yuli Ye:
Gate Circuits with Feedback in Finite Multivalued Algebras of Transients. J. Multiple Valued Log. Soft Comput. 16(1-2): 155-176 (2010) - [c38]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. CSR 2010: 84-95 - [c37]Janusz A. Brzozowski:
Complexity in Convex Languages. LATA 2010: 1-15 - [c36]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient Complexity of Ideal Languages. LATIN 2010: 208-221 - [c35]Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. DCFS 2010: 27-37 - [i8]Janusz A. Brzozowski, Galina Jirásková, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages. CoRR abs/1006.4843 (2010) - [i7]Janusz A. Brzozowski, Yuli Ye:
Syntactic Complexity of Ideal and Closed Languages. CoRR abs/1010.3263 (2010) - [i6]Janusz A. Brzozowski, Bo Liu:
Quotient Complexity of Star-Free Languages. CoRR abs/1012.3962 (2010)
2000 – 2009
- 2009
- [j69]Thomas Ang, Janusz A. Brzozowski:
Languages Convex with Respect to Binary Relations, and Their Closure Properties. Acta Cybern. 19(2): 445-464 (2009) - [j68]Janusz A. Brzozowski, Stavros Konstantinidis:
State-complexity hierarchies of uniform languages of alphabet-size length. Theor. Comput. Sci. 410(35): 3223-3235 (2009) - [j67]Janusz A. Brzozowski, Nicolae Santean:
Predictable semiautomata. Theor. Comput. Sci. 410(35): 3236-3249 (2009) - [c34]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. Developments in Language Theory 2009: 125-144 - [c33]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision Problems for Convex Languages. LATA 2009: 247-258 - [c32]Janusz A. Brzozowski:
Quotient Complexity of Regular Languages. DCFS 2009: 17-28 - [i5]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages and Kuratowski's Theorem. CoRR abs/0901.3761 (2009) - [i4]Janusz A. Brzozowski, Elyot Grant, Jeffrey O. Shallit:
Closures in Formal Languages: Concatenation, Separation, and Algorithms. CoRR abs/0901.3763 (2009) - [i3]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient complexity of ideal languages. CoRR abs/0908.2083 (2009) - [i2]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. CoRR abs/0912.1034 (2009) - 2008
- [c31]Thomas Ang, Janusz A. Brzozowski:
Continuous Languages. AFL 2008: 74-85 - [c30]Janusz A. Brzozowski, Stavros Konstantinidis:
State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length. DCFS 2008: 97-108 - [c29]Janusz A. Brzozowski, Nicolae Santean:
Determinism without Determinization. DCFS 2008: 109-120 - [i1]Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision Problems For Convex Languages. CoRR abs/0808.1928 (2008) - 2007
- [j66]Janusz A. Brzozowski, Helmut Jürgensen:
Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules. Int. J. Found. Comput. Sci. 18(5): 1065-1087 (2007) - [c28]Janusz A. Brzozowski, Yuli Ye:
Simulation of Gate Circuits with Feedback in Multi-Valued Algebras. ISMVL 2007: 46 - 2006
- [j65]Yuli Ye, Janusz A. Brzozowski:
Covering of Transient Simulation of Feedback-free Circuits by Binary Analysis. Int. J. Found. Comput. Sci. 17(4): 949-974 (2006) - [j64]Janusz A. Brzozowski, Helmut Jürgensen:
Errata: "representation of Semiautomata by Canonical Words and Equivalences". Int. J. Found. Comput. Sci. 17(5): 1231-1232 (2006) - [j63]Janusz A. Brzozowski:
Representation of a class of nondeterministic semiautomata by canonical words. Theor. Comput. Sci. 356(1-2): 46-57 (2006) - [p2]Janusz A. Brzozowski:
Topics in Asynchronous Circuit Theory. Recent Advances in Formal Languages and Applications 2006: 11-42 - 2005
- [j62]Janusz A. Brzozowski, Helmut Jürgensen:
Representation of semiautomata by canonical words and equivalences. Int. J. Found. Comput. Sci. 16(5): 831-850 (2005) - [j61]Janusz A. Brzozowski, Mihaela Gheorghiu:
Gate circuits in the algebra of transients. RAIRO Theor. Informatics Appl. 39(1): 67-91 (2005) - 2004
- [j60]Janusz A. Brzozowski:
Involuted Semilattices and Uncertainty in Ternary Algebras. Int. J. Algebra Comput. 14(3): 295-310 (2004) - [c27]Janusz A. Brzozowski, Radu Negulescu:
Duality for Three: Ternary Symmetry in Process Spaces. Theory Is Forever 2004: 1-14 - [c26]Janusz A. Brzozowski, Helmut Jürgensen:
Representation of Semiautomata by Canonical Words and Equivalences. DCFS 2004: 13-27 - 2003
- [j59]Signe J. Silver, Janusz A. Brzozowski:
True Concurrency in Models of Asynchronous Circuit Behavior. Formal Methods Syst. Des. 22(3): 183-203 (2003) - [j58]Janusz A. Brzozowski, Zoltán Ésik:
Hazard Algebras. Formal Methods Syst. Des. 23(3): 223-256 (2003) - [j57]Mihaela Gheorghiu, Janusz A. Brzozowski:
Simulation Of Feedback-Free Circuits In The Algebra Of Transients. Int. J. Found. Comput. Sci. 14(6): 1033-1054 (2003) - [j56]Janusz A. Brzozowski, Tadeusz Luba:
Decomposition of Boolean Functions Specified by Cubes. J. Multiple Valued Log. Soft Comput. 9(4): 377-417 (2003) - 2002
- [j55]Piotr R. Sidorowicz, Janusz A. Brzozowski:
A framework for testing special-purpose memories. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(12): 1459-1468 (2002) - [c25]Janusz A. Brzozowski, Mihaela Gheorghiu:
Simulation of Gate Circuits in the Algebra of Transients. CIAA 2002: 57-66 - [c24]Mihaela Gheorghiu, Janusz A. Brzozowski:
Feedback-Free Circuits in the Algebra of Transients. CIAA 2002: 106-116 - 2001
- [j54]Janusz A. Brzozowski:
A Characterization of De Morgan Algebras. Int. J. Algebra Comput. 11(5): 525-528 (2001) - [c23]Janusz A. Brzozowski, Zoltán Ésik, Y. Iland:
Algebras for Hazard Detection. ISMVL 2001: 3-14 - 2000
- [j53]Janusz A. Brzozowski, Hao Zhang:
Delay-Insensitivity and Semi-Modularity. Formal Methods Syst. Des. 16(2): 191-218 (2000) - [j52]Janusz A. Brzozowski, Radu Negulescu:
Automata of Asynchronous Behaviors. Theor. Comput. Sci. 231(1): 113-128 (2000) - [j51]Janusz A. Brzozowski:
Delay-insensitivity and ternary simulation. Theor. Comput. Sci. 245(1): 3-25 (2000) - [c22]Janusz A. Brzozowski:
De Morgan Bisemilattices. ISMVL 2000: 173-178 - [p1]Janusz A. Brzozowski, Zoltán Ésik:
Hazard Algebras (Extended Abstract). A Half-Century of Automata Theory 2000: 1-19
1990 – 1999
- 1999
- [j50]Chuanjin Richard Shi, Janusz A. Brzozowski:
A Characterization of Signed Hypergraphs and Its Applications to VLSI Via Minimization and Logic Synthesis. Discret. Appl. Math. 90(1-3): 223-243 (1999) - [j49]Janusz A. Brzozowski, Helmut Jürgensen:
Erratum to An Algebra of Multiple Faults in RAMs. J. Electron. Test. 14(3): 305-306 (1999) - [c21]Janusz A. Brzozowski, Helmut Jürgensen:
Semilattices of Fault Semiautomata. Jewels are Forever 1999: 3-15 - [c20]J. J. Lou, Janusz A. Brzozowski:
A Generalization of Shestakov's Function Decomposition Method. ISMVL 1999: 66-71 - 1998
- [j48]Radu Negulescu, Janusz A. Brzozowski:
Relative Liveness: From Intuition to Automated Verification. Formal Methods Syst. Des. 12(1): 73-115 (1998) - [j47]Chuanjin Richard Shi, Janusz A. Brzozowski:
Cluster-cover a theoretical framework for a class of VLSI-CAD optimization problems. ACM Trans. Design Autom. Electr. Syst. 3(1): 76-107 (1998) - [c19]Piotr R. Sidorowicz, Janusz A. Brzozowski:
An Approach to Modeling and Testing Memories and Its Application to CAMs. VTS 1998: 411-417 - 1997
- [j46]René David, Janusz A. Brzozowski, Helmut Jürgensen:
Testing for Bounded Faults in RAMs. J. Electron. Test. 10(3): 197-214 (1997) - [j45]Janusz A. Brzozowski, J. J. Lou, Radu Negulescu:
A Characterization of Finite Ternary Algebras. Int. J. Algebra Comput. 7(6): 713-722 (1997) - [c18]Janusz A. Brzozowski, Radu Negulescu:
Automata of Asynchronous Behaviors. Workshop on Implementing Automata 1997: 29-45 - 1996
- [j44]Janusz A. Brzozowski, Helmut Jürgensen:
An algebra of multiple faults in RAMs. J. Electron. Test. 8(2): 129-142 (1996) - 1995
- [b1]Janusz A. Brzozowski, Carl-Johan H. Seger:
Asynchronous Circuits. Monographs in Computer Science, Springer 1995, ISBN 978-0-387-94420-3, pp. I-XVI, 1-404 - [c17]Chuanjin Richard Shi, Janusz A. Brzozowski:
A framework for the analysis and design of algorithms for a class of VLSI-CAD optimization problems. ASP-DAC 1995 - [c16]Radu Negulescu, Janusz A. Brzozowski:
Relative liveness: from intuition to automated verification. ASYNC 1995: 108-117 - [c15]Janusz A. Brzozowski, Kaamran Raahemifar:
Testing C-elements is not elementary. ASYNC 1995: 150-159 - 1994
- [j43]Carl-Johan H. Seger, Janusz A. Brzozowski:
Generalized Ternary Simulation of Sequential Circuits. RAIRO Theor. Informatics Appl. 28(3-4): 159-186 (1994) - 1992
- [j42]Janusz A. Brzozowski, Helmut Jürgensen:
A model for sequential machine testing and diagnosis. J. Electron. Test. 3(3): 219-234 (1992) - [j41]Bruce F. Cockburn, Janusz A. Brzozowski:
Near-optimal tests for classes of write-triggered coupling faults in RAMs. J. Electron. Test. 3(3): 251-264 (1992) - [j40]Janusz A. Brzozowski, Jo C. Ebergen:
On the Delay-Sensitivity of Gate Networks. IEEE Trans. Computers 41(11): 1349-1360 (1992) - [c14]Chuanjin Richard Shi, Janusz A. Brzozowski:
Efficient constrained encoding for VLSI sequential logic synthesis. EURO-DAC 1992: 266-271 - 1991
- [j39]Janusz A. Brzozowski, T. Gahlinger, Farhad Mavaddat:
Consistency and satisfiability of waveform timing specifications. Networks 21(1): 91-107 (1991) - 1990
- [j38]Janusz A. Brzozowski, Bruce F. Cockburn:
Detection of coupling faults in RAMs. J. Electron. Test. 1(2): 151-162 (1990) - [j37]Bruce F. Cockburn, Janusz A. Brzozowski:
Switch-level testability of the dynamic CMOS PLA. Integr. 9(1): 49-80 (1990)
1980 – 1989
- 1989
- [j36]Janusz A. Brzozowski:
Minimization by reversal is not new. Bull. EATCS 37: 130 (1989) - [j35]Janusz A. Brzozowski, Carl-Johan H. Seger:
A unified framework for race analysis of asynchronous networks. J. ACM 36(1): 20-45 (1989) - [c13]Janusz A. Brzozowski, Jo C. Ebergen:
Recent Developments in the Design of Asynchronous Circuits. FCT 1989: 78-94 - 1988
- [j34]Carl-Johan H. Seger, Janusz A. Brzozowski:
An Optimistic Ternary Simulation of Gate Races. Theor. Comput. Sci. 61: 49-66 (1988) - 1987
- [j33]Janusz A. Brzozowski, Michael Yoeli:
Combinational static CMOS networks. Integr. 5(2): 103-122 (1987) - [j32]Janusz A. Brzozowski, Carl-Johan H. Seger:
A Characterization of Ternary Simulation of Gate Networks. IEEE Trans. Computers 36(11): 1318-1327 (1987) - 1986
- [j31]Janusz A. Brzozowski, Robert Knast:
Graph Congruences and Pair Testing. RAIRO Theor. Informatics Appl. 20(2): 129-147 (1986) - [c12]Janusz A. Brzozowski, Michael Yoeli:
Combinatorial Static CMOD Networks (Extended Summary). Aegean Workshop on Computing 1986: 271-282 - [c11]Janusz A. Brzozowski, Carl-Johan H. Seger:
Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary). ICALP 1986: 69-78 - 1985
- [j30]Janusz A. Brzozowski, S. Muro:
On serializability. Int. J. Parallel Program. 14(6): 387-403 (1985) - 1984
- [j29]Janusz A. Brzozowski, Faith E. Fich:
On generalized locally testable languages. Discret. Math. 50: 153-169 (1984) - 1980
- [j28]Janusz A. Brzozowski, Faith E. Fich:
Languages of R-Trivial Monoids. J. Comput. Syst. Sci. 20(1): 32-49 (1980) - [j27]Janusz A. Brzozowski, Ernst L. Leiss:
On Equations for Regular Languages, Finite Automata, and Sequential Networks. Theor. Comput. Sci. 10: 19-35 (1980) - [c10]Janusz A. Brzozowski:
Developments in the Theory of regular Languages. IFIP Congress 1980: 29-40
1970 – 1979
- 1979
- [j26]Janusz A. Brzozowski, Michael Yoeli:
On a Ternary Model of Gate Networks. IEEE Trans. Computers 28(3): 178-184 (1979) - [c9]Faith E. Fich, Janusz A. Brzozowski:
A Characterization of a Dot-Depth Two Analogue of Generalized Definite Languages. ICALP 1979: 230-244 - 1978
- [j25]Janusz A. Brzozowski, Robert Knast:
The Dot-Depth Hierarchy of Star-Free Languages is Infinite. J. Comput. Syst. Sci. 16(1): 37-55 (1978) - 1976
- [j24]John A. Brzozowski:
Run languages. Discret. Math. 16(4): 299-307 (1976) - [j23]Janusz A. Brzozowski:
Hierarchies of Aperiodic Languages. RAIRO Theor. Informatics Appl. 10(2): 33-49 (1976) - 1974
- [c8]Janusz A. Brzozowski, Michael Yoeli:
Models for Analysis of Races in Sequential Networks. MFCS 1974: 26-32 - 1973
- [j22]Janusz A. Brzozowski, Imre Simon:
Characterizations of locally testable events. Discret. Math. 4(3): 243-271 (1973) - 1972
- [j21]Dilip K. Banerji, Janusz A. Brzozowski:
On Translation Algorithms in Residue Number Systems. IEEE Trans. Computers 21(12): 1281-1285 (1972) - 1971
- [j20]Rina S. Cohen, Janusz A. Brzozowski:
Dot-Depth of Star-Free Events. J. Comput. Syst. Sci. 5(1): 1-16 (1971) - [j19]Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian:
Classification of Noncounting Events. J. Comput. Syst. Sci. 5(1): 41-53 (1971) - [j18]Janusz A. Brzozowski:
About Feedback and SR Flip-Flops. IEEE Trans. Computers 20(4): 476 (1971) - [c7]Janusz A. Brzozowski, Imre Simon:
Characterizations of Locally Testable Events. SWAT 1971: 166-176 - 1970
- [j17]Rina S. Cohen, Janusz A. Brzozowski:
General Properties of Star Height of Regular Events. J. Comput. Syst. Sci. 4(3): 260-280 (1970) - [j16]Janusz A. Brzozowski:
R70-44 Synchronization and General Repetitive Machines, with Applications to Ultimate Definite Automata. IEEE Trans. Computers 19(10): 989-990 (1970)
1960 – 1969
- 1969
- [j15]Janusz A. Brzozowski, Rina S. Cohen:
On Decompositions of Regular Events. J. ACM 16(1): 132-144 (1969) - [j14]Dilip K. Banerji, Janusz A. Brzozowski:
Sign Detection in Residue Number Systems. IEEE Trans. Computers 18(4): 313-320 (1969) - 1968
- [j13]Janusz A. Brzozowski, Shanker Singh:
Definite Asynchronous Sequential Circuits. IEEE Trans. Computers 17(1): 18-26 (1968) - [c6]Janusz A. Brzozowski:
Regular-Like Expressions for Some Irregular Languages. SWAT 1968: 278-286 - 1967
- [j12]Janusz A. Brzozowski:
On Single-Loop Realizations of Sequential Machines. Inf. Control. 10(3): 292-314 (1967) - [j11]Janusz A. Brzozowski:
Roots of Star Events. J. ACM 14(3): 466-477 (1967) - [c5]Janusz A. Brzozowski, Rina S. Cohen:
On Decompositions of Regular Events. SWAT 1967: 255-264 - [c4]Rina S. Cohen, Janusz A. Brzozowski:
On the Star Height of Regular Events. SWAT 1967: 265-279 - 1966
- [j10]Wayne A. Davis, Janusz A. Brzozowski:
On the Linearity of Sequential Machines. IEEE Trans. Electron. Comput. 15(1): 21-29 (1966) - [c3]Janusz A. Brzozowski:
Roots of Star Events. SWAT 1966: 88-95 - 1965
- [j9]Janusz A. Brzozowski:
Regular Expressions for Linear Sequential Circuits. IEEE Trans. Electron. Comput. 14(2): 148-156 (1965) - [j8]Janusz A. Brzozowski:
Some Problems in Relay Circuit Design. IEEE Trans. Electron. Comput. 14(4): 630-634 (1965) - [c2]Janusz A. Brzozowski:
On single-loop realizations of automata. SWCT 1965: 84-93 - 1964
- [j7]Janusz A. Brzozowski:
Derivatives of Regular Expressions. J. ACM 11(4): 481-494 (1964) - [j6]Janusz A. Brzozowski, Edward J. McCluskey:
About Signal Flow Graph Techniques for Sequential Circuits. IEEE Trans. Electron. Comput. 13(2): 154 (1964) - [j5]Janusz A. Brzozowski, Wayne A. Davis:
On the Linearity of Autonomous Sequential Machines. IEEE Trans. Electron. Comput. 13(6): 673-679 (1964) - [j4]Janusz A. Brzozowski:
Regular Expressions from Sequential Circuits. IEEE Trans. Electron. Comput. 13(6): 741-744 (1964) - [c1]Wayne A. Davis, Janusz A. Brzozowski:
On the linearity of sequential machines. SWCT 1964: 197-208 - 1963
- [j3]Janusz A. Brzozowski, Edward J. McCluskey:
Signal Flow Graph Techniques for Sequential Circuit State Diagrams. IEEE Trans. Electron. Comput. 12(2): 67-76 (1963) - [j2]Janusz A. Brzozowski, J. F. Poage:
On the Construction of Sequential Machines from Regular Expressions. IEEE Trans. Electron. Comput. 12(4): 402-403 (1963) - 1962
- [j1]Janusz A. Brzozowski:
A Survey of Regular Expressions and Their Applications. IRE Trans. Electron. Comput. 11(3): 324-335 (1962)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
