Space Complexity Vs. Query Complexity (original) (raw)
Related papers
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing, 2001
omega-Regular Languages Are Testable with a Constant Number of Queries
2002
Languages that are Recognized by Simple Counter Automata are not necessarily Testable
2005
Efficient Constructions of Test Sets for Regular and Context-Free Languages
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Some connections between bounded query classes and non-uniform complexity
Information and Computation, 2003
A perfect model for bounded verification
2012
Query-Number Preserving Reductions and Linear Lower Bounds for Testing
IEICE Transactions on Information and Systems, 2010
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science - ITCS '14, 2014
Property Testing: Monotonicity and regular languages, Lower bounds
2020
Some Decision Questions Concerning the Time Complexity of Language Acceptors
Complexity of Some Problems from the Theory of Automata
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata
Computers Ieee Transactions on, 1991
Work-sensitive Dynamic Complexity of Formal Languages
Lecture Notes in Computer Science, 2021
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory - ICDT '12, 2012
The invariant problem for binary string structures and the parallel complexity theory of queries
Journal of Computer and System Sciences, 1992
A General Testability Theory: Classes, Properties, Complexity, and Testing Reductions
IEEE Transactions on Software Engineering, 2014
From Regular to Strictly Locally Testable Languages
International Journal of Foundations of Computer Science, 2012
Property testing of regular tree languages
2004
Some properties are not even partially testable
Bounded queries in recursion theory: a survey
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Theoretical Computer Science, 1985
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
Foundations of Software Technology and Theoretical Computer Science, 2021
2019
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing, 1999
Lower bounds and the hardness of counting properties
2002
A Techniques Oriented Survey of Bounded Queries
Models and Computability, 1999
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets
Journal of Symbolic Logic, 2001
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences, 2005
On the Complexity of Search Queries
Fundamentals of Information Systems, 1999
International Journal of Foundations of Computer Science, 1994
Abstract Some Results in Computational Complexity
2008
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science, 1998
Machine-Independent Complexity Theory
1990
Does query evaluation tractability help query containment?
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2014