Author of the publication

w-Regular languages are testable with a constant number of queries

, and . Theor. Comput. Sci., 329 (1-3): 71-92 (2004)
DOI: 10.1016/j.tcs.2004.08.004

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

Good-Enough Synthesis., and . CAV (2), volume 12225 of Lecture Notes in Computer Science, page 541-563. Springer, (2020)Once and for all., , and . J. Comput. Syst. Sci., 78 (3): 981-996 (2012)On the universal and existential fragments of the mu-calculus., , and . Theor. Comput. Sci., 354 (2): 173-186 (2006)Perspective Multi-Player Games., and . LICS, page 1-13. IEEE, (2021)Automatic Generation of Quality Specifications., , and . CAV, volume 8044 of Lecture Notes in Computer Science, page 479-494. Springer, (2013)Lazy Regular Sensing., and . DCFS, volume 13439 of Lecture Notes in Computer Science, page 155-169. Springer, (2022)Model checking for Branching-Time temporal logics.. Technion - Israel Institute of Technology, Israel, (1995)Prime Languages., and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 607-618. Springer, (2013)Safraless Decision Procedures., and . FOCS, page 531-542. IEEE Computer Society, (2005)From Correctness to High Quality.. FMCAD, page 1. IEEE, (2020)