( en | de | ru )

 

Disambiguation of "Brzozowski, Janusz A."

Author of the publication

copydeleteadd this publication to your clipboard
Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages.

, and . Journal of Automata, Languages and Combinatorics, 22 (1-3): 29-59 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marcin Brzozowski

Marcin Brzozowski

Janusz Panzer

Janusz Gatniejewski

Janusz Rat

 

Other publications of authors with the same name

Syntactic Complexities of Some Classes of Star-Free Languages., and . DCFS, volume 7386 of Lecture Notes in Computer Science, page 117-129. Springer, (2012)Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages., , and . DCFS, volume 6808 of Lecture Notes in Computer Science, page 93-106. Springer, (2011)Syntactic Complexity of - and -Trivial Regular Languages., and . DCFS, volume 8031 of Lecture Notes in Computer Science, page 160-171. Springer, (2013)Recent Developments in the Design of Asynchronous Circuits., and . FCT, volume 380 of Lecture Notes in Computer Science, page 78-94. Springer, (1989)Syntactic Complexity of Regular Ideals., , and . Theory Comput. Syst., 62 (5): 1175-1202 (2018)A framework for the analysis and design of algorithms for a class of VLSI-CAD optimization problems., and . ASP-DAC, ACM, (1995)Upper Bound on Syntactic Complexity of Suffix-Free Languages., and . DCFS, volume 9118 of Lecture Notes in Computer Science, page 33-45. Springer, (2015)A Characterization of Finite Ternary Algebras., , and . Int. J. Algebra Comput., 7 (6): 713-722 (1997)Dot-Depth of Star-Free Events., and . J. Comput. Syst. Sci., 5 (1): 1-16 (1971)Theory of átomata., and . Theor. Comput. Sci., (2014)