Author of the publication

Extending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars.

, , and . QEST, volume 10503 of Lecture Notes in Computer Science, page 3-19. Springer, (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.

 

Other publications of authors with the same name

Stability Preserving Simulations and Bisimulations for Hybrid Systems., , and . IEEE Trans. Automat. Contr., 60 (12): 3210-3225 (2015)Conformance testing in the presence of multiple faults., and . SODA, page 1136-1145. SIAM, (2005)Verification of Bounded Discrete Horizon Hybrid Automata., , , and . IEEE Trans. Automat. Contr., 57 (6): 1445-1455 (2012)Document recognition: an attribute grammar approach., , and . Document Recognition, volume 2660 of SPIE Proceedings, page 101-113. SPIE, (1996)Testing and Spot-Checking of Data Streams., , , and . Algorithmica, 34 (1): 67-80 (2002)On the expressiveness and complexity of randomization in finite state monitors., , and . J. ACM, 56 (5): 26:1-26:44 (2009)Java-MaC: A Run-Time Assurance Approach for Java Programs., , , , and . Formal Methods Syst. Des., 24 (2): 129-155 (2004)Exact quantitative probabilistic model checking through rational search., , , , and . Formal Methods Syst. Des., 56 (1): 90-126 (2020)Spot-Checkers., , , , and . J. Comput. Syst. Sci., 60 (3): 717-751 (2000)How Can Automatic Feedback Help Students Construct Automata?, , , , , and . ACM Trans. Comput. Hum. Interact., 22 (2): 9:1-9:24 (2015)