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
Control of Discrete Event Systems
TL;DR: The main focus of this paper is the presentation of the automata and formal language model for DES introduced by Raniadge and Wonham in 1985, suitable for the examination of some important control theoretic issues, and provides a good basis for modular synthesis of controllers.
Proceedings Article
The even more irresistible SROIQ
TL;DR: A rather elegant tableau-based reasoning algorithm that combines the use of automata to keep track of universal value restrictions with the techniques developed for SHOIQ, which has been adopted as the logical basis for the next iteration of OWL, OWL 1.1.
Journal ArticleDOI
Composition in distributional models of semantics.
Jeff Mitchell,Mirella Lapata +1 more
TL;DR: This article proposes a framework for representing the meaning of word combinations in vector space in terms of additive and multiplicative functions, and introduces a wide range of composition models that are evaluated empirically on a phrase similarity task.
Journal ArticleDOI
Model-Checking in Dense Real-Time
TL;DR: An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
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.