Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Introduction to the Theory of Computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Exercise 1. A 2-counter machine (2CM) has a finite state control, and two stacks on which it can push and pop tokens, where these… Expand
Is this relevant?
2013
2013
for any two regular expressions R and S over Σ. Problem 2 (20 pts). Let Σ be an alphabet. Recall that a binary relation, ∼, on… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Abstract The MapReduce framework has been generating a lot of interest in a wide range of areas. It has been widely adopted in… Expand
Is this relevant?
2012
2012
Baker and Cirinei (Lecture Notes in Computer Science, vol. 4878, Springer, pp. 62–75, 2007) have introduced an exact but naive… Expand
Is this relevant?
2010
2010
This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioural… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A programming approach to computability and complexity theory yields proofs of central results that are sometimes more natural… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
From the Publisher:
Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and… Expand
Is this relevant?
Highly Cited
1996
1994
1994
From the Publisher:
The aim of this textbook is to present an account of the theory of computation. After introducing the… Expand
Is this relevant?
Highly Cited
1989