Open AccessBook
Introduction to Automata Theory, Languages, and Computation
TLDR
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.Abstract:
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.read more
Citations
More filters
Posted Content
Dynamic systems as tools for analysing human judgement
TL;DR: How the task demands of system identification and system control can be realised in these environments, and how psychometrically acceptable dependent variables can be derived are set out.
Book ChapterDOI
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
Roy Armoni,Limor Fix,Alon Flaisher,Rob Gerth,Boris Ginsburg,Tomer Kanza,Avner Landver,Sela Mador-Haim,Eli Singerman,Andreas Tiemeyer,Moshe Y. Vardi,Yael Zbar +11 more
TL;DR: The ForSpec Temporal Logic (FTL) is the new temporal property-specification logic of ForSpec, Intel's new formal specification language and includes constructs that enable the user to model multiple clock and reset signals, which is useful in the verification of hardware design.
Journal ArticleDOI
Incremental elaboration of scenario-based specifications and behavior models using implied scenarios
TL;DR: A process for elaborating system behavior that exploits the potential benefits of behavior modeling and scenario-based specifications yet ameliorates their shortcomings is proposed.
Journal ArticleDOI
The Complexity of Propositional Proofs
TL;DR: The complexity of propositional proofs has been investigated systematically only since the late 1960s as discussed by the authors, and substantial progress has been made in determining the relative complexity of proof systems, and in proving strong lower bounds for some restricted proof systems.
Book
Essentials of Artificial Intelligence
TL;DR: Based on the author's course at Stanford University, Essentials of Artificial Intelligence is an integrated, cohesive introduction to the field that combines clear presentations with humor and AI anecdotes.
References
More filters
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.