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 computation in model gene networks.
TL;DR: This work analyzes a class of ordinary differential equations representing a simplified model of a genetic network and defines bifurcations of chaotic dynamics of the differential equation that correspond to changes in the associated language.
Book
Modern Algebra with Applications
TL;DR: In this paper, the Second Edition List of Symbols (SLL) of Boolean algebra is presented, which is a list of symbols from the first edition of the list of odd-numbered exercises.
Journal ArticleDOI
Coordinate-independent mapping of structural and functional data by objective relational transformation (ORT).
TL;DR: This work describes the methodology of ORT, a formally defined, transparent transformation method for reproducible, coordinate-independent mapping of brain data to freely chosen parcellation schemes, and shows that ORT in conjunction with connectivity databases like CoCoMac is an important tool for analyses of cortical organization and structure-function relationships.
Journal ArticleDOI
Prediction, Retrodiction, and the Amount of Information Stored in the Present
TL;DR: In this article, the authors introduce an ambidextrous view of stochastic dynamical systems, comparing their forward-time and reverse-time representations and then integrating them into a single time-symmetric representation.
Journal ArticleDOI
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
Frank Neven,Thomas Schwentick +1 more
TL;DR: In this paper, the complexity of the containment problem for various fragments of XPath is studied, focusing on the most common XPath expressions which navigate along the child and/or descendant axis.
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.