Verifying secrets and relative secrecy
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for testing core-based systems-on-a-chip
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
On the arithmetic power of context-free languages
CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
TAO: regular expression-based register-transfer level testability analysis and optimization
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Interactive Pushdown Automata Animation
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Computational complexity of some problems involving congruences on algebras
Theoretical Computer Science
Digital life behavior in the amoeba world
Artificial Life
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Agent-Based Simulation in the Study of Social Dilemmas
Artificial Intelligence Review
Computing inside the billiard ball model
Collision-based computing
Query Rewriting with Symmetric Constraints
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Evolving Turing Machines for Biosequence Recognition and Analysis
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Random Number Generation with +-NFAs
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
TAO: regular expression based high-level testability analysis and optimization
ITC '98 Proceedings of the 1998 IEEE International Test Conference
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algebraic rewritings for optimizing regular path queries
Theoretical Computer Science - Database theory
Computational Complexity of Some Problems Involving Congruences on Algebras
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Reducing Test Application Time in High-Level Test Generation
ITC '00 Proceedings of the 2000 IEEE International Test Conference
Theoretical Computer Science
Image indexing and similarity retrieval based on spatial relationship model
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
Theoretical Computer Science - Special issue: Tilings of the plane
Tutorial on computational complexity
Interfaces
On interactive proofs with a laconic prover
Computational Complexity
Proceedings of the 1st conference on Computing frontiers
An algorithm for constructing an even grammar from a language sample
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Solving a PSPACE-complete problem by recognizing P systems with restricted active membranes
Fundamenta Informaticae
Providing curricular assistance to a third world university computer science department
Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Journal of Parallel and Distributed Computing
Implementation experience with collision avoidance in signing avatars
AFRIGRAPH '04 Proceedings of the 3rd international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Minimal DFA for testing divisibility
Journal of Computer and System Sciences
Minimization of unary symmetric difference NFAs
SAICSIT '04 Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
A note on tolerance graph recognition
Discrete Applied Mathematics
Introducing practical applications into a computational theory class
Journal of Computing Sciences in Colleges
On binary ⊕-NFAs and succinct descriptions of regular languages
Theoretical Computer Science - Implementation and application of automata
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Composition of mappings given by embedded dependencies
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A visual and interactive automata theory course emphasizing breadth of automata
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Energy Aware Computing through Probabilistic Switching: A Study of Limits
IEEE Transactions on Computers
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
Wakeup scheduling in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
New algorithms research for first year students
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Application of finite state automata to the bakery algorithm in critical section modeling
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Games for complexity of second-order call-by-name programs
Theoretical Computer Science - Game theory meets theoretical computer science
Procedural modeling of buildings
ACM SIGGRAPH 2006 Papers
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Dynamic labeling schemes for ordered XML based on type information
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Constructing an even grammar from a 2-element sample
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Journal of Computing Sciences in Colleges
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
Theoretical Computer Science
Composition of mappings given by embedded dependencies
ACM Transactions on Database Systems (TODS)
Small fast universal turing machines
Theoretical Computer Science
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Interactive symbolic software for teaching formal languages, automata and beyond
Journal of Computing Sciences in Colleges
On the computability of agent-based workflows
Decision Support Systems
Language based policy analysis in a SPKI Trust Management System
Journal of Computer Security
Role classification of hosts within enterprise networks based on connection patterns
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
A Discreet, Fault-Tolerant, and Scalable Software Architectural Style for Internet-Sized Networks
ICSE COMPANION '07 Companion to the proceedings of the 29th International Conference on Software Engineering
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Safety checking of kernel extensions
ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference
MISE '07 Proceedings of the International Workshop on Modeling in Software Engineering
An Architectural Style for Solving Computationally Intensive Problems on Large Networks
SEAMS '07 Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems
Searching on the secondary structure of protein sequences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the fairness and complexity of generalized k-in-a-row games
Theoretical Computer Science
Directed test generation using symbolic grammars
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Automatic rule-based expert system for English to Thai transcription
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
International Journal of Robotics Research
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Formal languages through web forms and regular expressions
ACM SIGCSE Bulletin
A conceptual approach to teaching induction for computer science
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Incorporating transformations into jflap for enhanced understanding of automata
Proceedings of the 39th SIGCSE technical symposium on Computer science education
Nondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science
Solving NP-complete problems in the tile assembly model
Theoretical Computer Science
EOOA: an extensible object oriented data model for automata applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Jug measuring: Algorithms and complexity
Theoretical Computer Science
How crystals that sense and respond to their environments could evolve
Natural Computing: an international journal
Statistical machine translation
ACM Computing Surveys (CSUR)
Semidefinite programming and arithmetic circuit evaluation
Discrete Applied Mathematics
Building bug-tolerant routers with virtualization
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Scheduling in a dynamic heterogeneous distributed system using estimation error
Journal of Parallel and Distributed Computing
Tiling problems, automata, and tiling graphs
Theoretical Computer Science
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Solving satisfiability in the tile assembly model with a constant-size tileset
Journal of Algorithms
Ether: malware analysis via hardware virtualization extensions
Proceedings of the 15th ACM conference on Computer and communications security
Semantics transformation of NFA to Z notation by constructing union of regular languages
ACS'08 Proceedings of the 8th conference on Applied computer scince
Combining Cognitive with Computational Trust Reasoning
Trust in Agent Societies
Two mathematical gestalts for computer theory
Proceedings of the 40th ACM technical symposium on Computer science education
New NP-Complete Problems Associated with Lattices
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A Recursive Padding Technique on Nondeterministic Cellular Automata
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the complement graph and defensive k-alliances
Discrete Applied Mathematics
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
Evolving distributed algorithms with genetic programming: election
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Crystal-growth-inspired algorithms for computational grids
BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimization of dynamic memory managers for embedded systems using grammatical evolution
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
HAMPI: a solver for string constraints
Proceedings of the eighteenth international symposium on Software testing and analysis
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A First-Order Policy Language for History-Based Transaction Monitoring
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Theoretical Computer Science
A Brief Critique of Pure Hypercomputation
Minds and Machines
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Conformant plans and beyond: Principles and complexity
Artificial Intelligence
On the Computation of Natural Observers in Discrete-Event Systems
Discrete Event Dynamic Systems
Problem-directed discrete structures course
Proceedings of the 41st ACM technical symposium on Computer science education
Resistor network-based algorithms for enumerating rational numbers
Journal of Computing Sciences in Colleges
Information and Computation
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Data preparation for data mining in medical data sets
Transactions on rough sets VI
Multi-letter reversible and quantum finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Interaction faults caused by third-party external systems: a case study and challenges
ISAS'08 Proceedings of the 5th international conference on Service availability
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Procedural modeling for digital cultural heritage
Journal on Image and Video Processing - Special issue on image and video processing for cultural heritage
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
The weight-constrained maximum-density subtree problem and related problems in trees
The Journal of Supercomputing
Concepts, Structures, and Goals: Redefining Ill-Definedness
International Journal of Artificial Intelligence in Education
Compatibility of XML language versions
SCM'01/SCM'03 Proceedings of the 2001 ICSE Workshops on SCM 2001, and SCM 2003 conference on Software configuration management
The Complexity of Restricted Variants of the Stable Paths Problem
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Computing stable outcomes in hedonic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A study of heuristic guesses for adiabatic quantum computation
Quantum Information Processing
Specification translation of state machines from equational theories into rewrite theories
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Computational Complexity in Non-Turing Models of Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
The PSPACE-Completeness of Black-White Pebbling
SIAM Journal on Computing
Theoretical Computer Science
Journal of Functional Programming
The generative capacity of the lambek-grishin calculus: a new lower bound
FG'09 Proceedings of the 14th international conference on Formal grammar
Component-based modeling of complete buildings
Proceedings of Graphics Interface 2011
Modeling and experimental validation of the data handover API
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
Proceedings of the 8th ACM International Conference on Computing Frontiers
Two-way automata versus logarithmic space
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Hidden variables simulating quantum contextuality increasingly violate the Holevo bound
UC'11 Proceedings of the 10th international conference on Unconventional computation
A random testing approach using pushdown automata
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Review: Of robot ants and elephants: A computational comparison
Theoretical Computer Science
Theoretical Computer Science
Studies in complexity and cryptography
Computing stable outcomes in hedonic games with voting-based deviations
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Note on reversal of binary regular languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Is there an ethics of algorithms?
Ethics and Information Technology
Ambiguity of unary symmetric difference NFAs
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A note on algebras of languages
Theoretical Computer Science
Journal of the ACM (JACM)
On a Logic for Coalitional Games with Priced-Resource Agents
Electronic Notes in Theoretical Computer Science (ENTCS)
A cell decomposition approach to visibility-based pursuit evasion among obstacles
International Journal of Robotics Research
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
An MDL approach to efficiently discover communities in bipartite network
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
A generalized method for constructing and proving zero-knowledge watermark proof systems
IWDW'04 Proceedings of the Third international conference on Digital Watermarking
On the complexity of universal programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Linking anonymous transactions: the consistent view attack
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Relating automata to other fields
Journal of Computing Sciences in Colleges
Theoretical Computer Science
Solving NP-Complete problems by spiking neural p systems with budding rules
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Process model based incremental project planning
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Efficient format-compliant encryption of regular languages: block-based cycle-walking
CMS'10 Proceedings of the 11th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Biological networks: comparison, conservation, and evolutionary trees
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Prefix-Free regular languages: closure properties, difference, and left quotient
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
An efficient protocol for oblivious DFA evaluation and applications
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Fast architecture prototyping through 3D collage
Multimedia Tools and Applications
Proton: multitouch gestures as regular expressions
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Learning driving behavior by timed syntactic pattern recognition
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Computer Science Review
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
Reversal of binary regular languages
Theoretical Computer Science
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Counter automata for parameterised timing analysis of box-based systems
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The state complexity of star-complement-star
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Tron, a combinatorial game on abstract graphs
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes
Fundamenta Informaticae
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation
Programming and evolving physical self-assembling systems in three dimensions
Natural Computing: an international journal
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Metrics for planetary rover planning & scheduling algorithms
Proceedings of the Workshop on Performance Metrics for Intelligent Systems
Natural networks as thermodynamic systems
Complexity
On properties and state complexity of deterministic state-partition automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Non-termination analysis and cost-based query optimization of logic programs
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Contour-based shape representation using principal curves
Pattern Recognition
Intricacies of quantum computational paths
Quantum Information Processing
XUTools: UNIX commands for processing next-generation structured text
lisa'12 Proceedings of the 26th international conference on Large Installation System Administration: strategies, tools, and techniques
Gaussian quantum computation with oracle-decision problems
Quantum Information Processing
Reliable Web service selection in choreographed environments
Decision Support Systems
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
From theory to practice: NP-completeness for every CS student
Proceedings of the 18th ACM conference on Innovation and technology in computer science education
Implementing Business Processes: A Database Trigger Approach
International Journal of Knowledge-Based Organizations
Detecting machine-morphed malware variants via engine attribution
Journal in Computer Virology
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the boundary of regular languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Automated grading of DFA constructions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Deciding unique decodability of bigram counts via finite automata
Journal of Computer and System Sciences
On exact algorithms for the permutation CSP
Theoretical Computer Science
CSP-based counter abstraction for systems with node identifiers
Science of Computer Programming
On Effective Convergence of Numerical Solutions for Differential Equations
ACM Transactions on Computation Theory (TOCT)
Tradeoff lower lounds for stack machines
Computational Complexity
Hi-index | 0.08 |
From the Publisher:Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on the theory of computation - builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own. INTRODUCTION TO THE THEORY OF COMPUTATION provides a mathematical treatment of computation theory grounded in theorems and proofs. Proofs are presented with a "proof idea" component to reveal the concepts underpinning the formalism. Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models. Topic coverage, terminology, and order of presentation are traditional for an upper-level course in computer science theory. Users of the Preliminary Edition (now out of print) will be interested to note several new chapters on complexity theory: Chapter 8 on space complexity; Chapter 9 on provable intractability, and Chapter 10 on advanced topics, including approximation algorithms, alternation, interactive proof systems, cryptography, and parallel computing.