Author of the publication

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.

, , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 305-316. Springer, (2001)

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.

 

Other publications of authors with the same name

On the Maximum Coefficients of Rational Formal Series in Commuting Variables., , and . Developments in Language Theory, volume 3340 of Lecture Notes in Computer Science, page 114-126. Springer, (2004)On the Prefixes of a Random Trace and the Membership Problem for Context-Free Trace Languages., and . AAECC, volume 356 of Lecture Notes in Computer Science, page 35-59. Springer, (1987)Analysis of a Class of Algorithms for Problems on Trace Languages., , and . AAECC, volume 307 of Lecture Notes in Computer Science, page 202-214. Springer, (1986)On the Complexity of Clustering with Relaxed Size Constraints., , and . AAIM, volume 9778 of Lecture Notes in Computer Science, page 26-38. Springer, (2016)Rational Transductions and Complexity of Counting Problems., and . MFCS, volume 629 of Lecture Notes in Computer Science, page 181-190. Springer, (1992)Interacting with an artificial partner: modeling the role of emotional aspects., , and . Biol. Cybern., 99 (6): 473-489 (2008)Preface., , and . Theor. Comput. Sci., (2017)Large Deviation Properties for Pattern Statistics in Primitive Rational Models., and . ICTCS, volume 3587 of CEUR Workshop Proceedings, page 192-205. CEUR-WS.org, (2023)On the Complexity of Unary Tiling-Recognizable Picture Languages., , and . STACS, volume 4393 of Lecture Notes in Computer Science, page 381-392. Springer, (2007)Local limit laws for symbol statistics in bicomponent rational models., , and . Theor. Comput. Sci., (August 2023)