Introduction to the theory of computation
Explore this paper's citation graph
- Published
- 1989-01-01
- Cited by
- 2,764
- References
- 0
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:785898
References
No references recorded for this paper.
Cited by
- Synthesis and Verification of Digital Circuits using Functional Simulation and Boolean Satisfiability
- Calculating RNA motif probabilities and recognizing patterns in sequence data
- Variants of the Consecutive Ones Property: Algorithms, Computational Complexity and Applications to Genomics
- Using factor score estimates in latent variable analysis
- Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP
- MiniMerge: Symmetry-Free Learning in Combinatorial Problems
- Semidefinite and Cone Programming Bibliography/Comments
- The Capricious Character of Nature
- Design and analysis of combinatorial protein libraries created by site-directed recombination
- Graph Searching and Related Problems
- Modal logic in computer science
- Automating and Validating Semantic Annotations
- Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet
- Cache characterization and performance studies using locality surfaces
- Design exploration and experimental validation of abstract requirements
- Alternating Towers and Piecewise Testable Separators
- Producing and verifying extremely large propositional refutations
- Crude, Cheesy, Second-Rate Consciousness
- Linear logic, type assignment systems and implicit computational complexity. (Logique linéaire, systèmes de types et complexité implicite)
- Dominance and Equivalence for Sensor-Based Agents
Related papers
No related papers recorded.