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
Journal ArticleDOI

Computability classes for enforcement mechanisms

TL;DR: A precise characterization of those security policies enforceable by program rewriting and some but not all classes can be identified with known classes from computational complexity theory.
Journal ArticleDOI

Reachability analysis of dynamical systems having piecewise-constant derivatives

TL;DR: The main results are a decision procedure for two-dimensional systems, and an undecidability result for three or more dimensions.
Proceedings ArticleDOI

Foundations of JSON Schema

TL;DR: This paper provides the first formal definition of syntax and semantics for JSON Schema and uses it to show that implementing this layer on top of JSON is feasible in practice.
Journal ArticleDOI

DNA molecule provides a computing machine with both data and fuel

TL;DR: It is shown that a single DNA molecule can provide both the input data and all of the necessary fuel for a molecular automaton, which can, in principle, process any input molecule of any length without external energy supply.
Journal ArticleDOI

The evolution of emergent computation

TL;DR: In this paper, a simple evolutionary process can discover sophisticated methods for emergent information processing in decentralized spatially extended systems, and the mechanisms underlying the resulting emergent computation are explicated by a technique for analyzing particle-based logic embedded in pattern-forming systems.
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.