ω-Regular languages are testable with a constant number of queries
- 13 December 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 329 (1-3) , 71-92
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Three theorems regarding testing graph propertiesRandom Structures & Algorithms, 2003
- A Sublinear Bipartiteness Tester for Bounded Degree GraphsCombinatorica, 1999
- Safety, liveness and fairness in temporal logicFormal Aspects of Computing, 1994
- Book Review: Design and Validation of Computer Protocols by Gerard J. Holzmann (Prentice Hall, 1991)ACM SIGCOMM Computer Communication Review, 1991
- Proof of a conjecture by Erdős and Graham concerning the problem of FrobeniusJournal of Number Theory, 1990
- Protocol validation in complex systemsACM SIGCOMM Computer Communication Review, 1989
- Expressibility results for linear-time and branching-time logics1989
- A Bound for a Solution of a Linear Diophantine ProblemJournal of the London Mathematical Society, 1972
- Decision problems forω-automataTheory of Computing Systems, 1969
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969