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
Symbolic dynamics and characterization of complexity
TL;DR: In this paper, the systematics of stable periodic solutions in the Lorenz model has been given basically by symbolic dynamics of the cubic map, which may be used to extract invariant characteristics from time series.
Decidability of bisimulation equivalence for processes generating context-free languages
TL;DR: In this paper, the equality on processes is given by a model of process graphs modulo bisimulation equivalence, and a short proof of the equivalence problem for simple context-free languages is given.
Proceedings ArticleDOI
Exact analysis of the cache behavior of nested loops
TL;DR: An exact model of the behavior of loop nests executing in a memory hicrarchy is developed by using a nontraditional classification of misses that has the key property of composability, allowing the model to gain efficiency in counting cache misses by exploiting repetitive patterns of cache behavior.
Proceedings ArticleDOI
Inferring models of concurrent systems from logs of their behavior with CSight
TL;DR: Algorithms for inferring CFSM models from traces of concurrent systems, proves them correct, provides an implementation, and evaluates the implementation in two ways: by running it on logs from three different networked systems and via a user study that focused on bug finding.
Proceedings ArticleDOI
Automatic synthesis of interfaces between incompatible protocols
TL;DR: This work proposes using regular expression based protocol descriptions to show how to map the message onto a signaling protocol, given two protocols, and proposes an algorithm to build an interface machine.
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.