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

Probabilistic vs. Nondeterministic Unary Automata., , , and . NCMA, volume 263 of books@ocg.at, page 33-44. Austrian Computer Society, (2010)On leftmost #-Rewriting Systems., and . DCFS, page 61-72. University of Prince Edward Island, (2008)The complexity of minimum difference cover., and . J. Discrete Algorithms, 4 (2): 239-254 (2006)Guest Column: Quantum Finite Automata: From Theory to Practice., and . SIGACT News, 52 (3): 38-59 (2021)Removing nondeterminism in constant height pushdown automata., , , and . Inf. Comput., (2014)More concise representation of regular languages by automata and regular expressions., , and . Inf. Comput., 208 (4): 385-394 (2010)Synthesis of unary quantum automata from periodic events.. University of Turin, Italy, (2003)Uniform Circle Formation for Swarms of Opaque Robots with Lights., , and . SSS, volume 11201 of Lecture Notes in Computer Science, page 317-332. Springer, (2018)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)Online Minimum Spanning Tree with Advice - (Extended Abstract)., , , , and . SOFSEM, volume 9587 of Lecture Notes in Computer Science, page 195-207. Springer, (2016)