scispace - formally typeset
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

Query-limited reducibilities

TL;DR: The Nonspeedup Theorem is proved, which states that 2$\sp{n}$ parallel queries to any fixed nonrecursive oracle cannot be answered by an algorithm that makes only n queries toAny oracle whatsoever.
Journal ArticleDOI

Automatic extraction of mutations from Medline and cross‐validation with OMIM

TL;DR: In this article, a method called MEMA was proposed to identify singleton mutations in conjunction with a HUGO gene name out of 16,728 abstracts of Medline, and the recall for the identification of mutation-gene pairs was estimated to be 35% at a precision of 93%.
Journal Article

The Role of Relativization in Complexity Theory.

TL;DR: This paper takes a look at how complexity theorists use and misuse oracle results and pays special attention to the new interactive proof systems and program checking results and tries to understand why they do not relativize.
Journal ArticleDOI

A web-based clinical decision support system for gestational diabetes: Automatic diet prescription and detection of insulin needs.

TL;DR: Sinedie generates safe advice about therapy adjustments, reduces the clinicians' workload and helps physicians to identify which patients need a more urgent or more exhaustive examination and those who present good metabolic control.
Proceedings Article

Rewarding behaviors

TL;DR: An algorithm is considered which, given a decision process with non-Markovian rewards expressed in this manner, automatically constructs an equivalent MDP (with Markovian reward structure), allowing optimal policy construction using standard techniques.
References
More filters
Book ChapterDOI

Representation of Events in Nerve Nets and Finite Automata

S. C. Kleene
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.