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
Editing by example
TL;DR: An editing by example system derived from an efficient heuristic that provably synthesizes a gap program from examples of its input/output behavior is embedded in a production text editor.
Journal ArticleDOI
The infimal closed controllable superlanguage and its application in supervisory control
Stéphane Lafortune,E. Chen +1 more
TL;DR: It is shown that the computation of the infimal closed controllable superlanguage plays a central role in problems that involve a tradeoff between satisficing and blocking.
Journal ArticleDOI
On the power of bounded concurrency I: finite automata
Doron Drusinsky,David Harel +1 more
TL;DR: Of the three fundamental notions for modeling concurrency, bounded concurrency is the strongest, representing a similar exponential saving even when substituted for each of the others, and exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs are proved.
Journal ArticleDOI
Discrete-event control of nondeterministic systems
Michael Heymann,Feng Lin +1 more
TL;DR: It is shown how well-known algorithms for supervisory control under partial observation can be adapted for synthesis of supervisors for nondeterministic systems subject to both language and trajectory-model specifications.
Journal ArticleDOI
Querying Graphs with Data
TL;DR: A family of languages that enable combination of data and topology querying for graph databases are presented, and it is shown that it includes efficient and highly expressive formalisms for querying both the structure of the data and the data itself.
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.