Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA 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)