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
Proceedings ArticleDOI
Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
TL;DR: The main result is that if there is a sparse NP-complete set under many-one reductions, then P = NP, and it is shown that if the set is under Turing reduction, then the polynomial time hierarchy collapses to Δ2P.
Journal ArticleDOI
Refereed paper: Authorship analysis: identifying the author of a program
Ivan Krsul,Eugene H. Spafford +1 more
TL;DR: The goal is to show that it is possible to identify the author of a program by examining programming style characteristics, and to find a set of characteristics that remain constant for a significant portion of the programs that this programmer might produce.
Book ChapterDOI
Applicability of Indexed Grammars to Natural Languages
TL;DR: This chapter discusses the class of context-free phrase structure grammars, which has been alluded to a number of times in the recent linguistic literature: by Klein (1981) in connection with nested comparative constructions, by Dahl (1982) in connected with topicalised pronouns, by Engdahl ( 1982) and Gazdar (1982).
Journal ArticleDOI
Formulas for calculating supremal controllable and normal sublanguages
TL;DR: In this article, the authors derived formulas for both supremal controllable and normal sublanguages when the languages involved are closed and showed that these formulas can be computed without applying recursive algorithms.
Journal ArticleDOI
Complexity results for HTN planning
TL;DR: How the complexity of HTN planning varies with various conditions on the task networks, and how it compares to STRIPS-style planning is described.
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.