scispace - formally typeset
Open AccessBook

Theory of Computation: Formal Languages, Automata, and Complexity

Reads0
Chats0
TLDR
This book discusses Grammatical Basis of Language Translation, Foundations of Recursive Function Theory, and the Scope of Primitive Recursive functions in Partial Recursive Functions.
Abstract
Preliminaries Review of Set Theory Grammatical Basis of Language Translation Historical Background Preview of the Remaining Text Chapter Review Problems Finite Automata and Regular Languages Lexical Analysis Deterministic Finite Automata The Limits of Deterministic Finite Automata Nondeterministic Finite Automata Regular Grammars Regular Expressions Closing Comments Chapter Review Problems Pushdown Automata and Context-Free Languages Pushdown Automata Context-Free Grammars The Limits of Pushdown Automata LL(k) Parsers LR(k) Parsers Turing Machines and Phase-Structure Languages Turing Machines Modular Construction of Turing Machines Turing Machines as Language Accepters Turing-Acceptable Languages Beyond Phrase-Structure Languages Closing Comments Chapter Review Problems Computability Foundations of Recursive Function Theory The Scope of Primitive Recursive Functions Partial Recursive Functions The Power of Programming Languages Closing Comments Chapter Review Problems Complexity Computations The Complexity of Algorithms The Complexity of Problems Time Complexity of Language Recognition Problems Time Complexity of Nondeterministic Machines Closing Comments Chapter Review Problems Appendices A More About Constructing LR(1) Parse Tables B More About Ackerman's Function C Some Important Unsolvable Problems D On the Complexity of the String Comparison Problem E A Sampling of NP Problems Additional Reading 0805301437T04062001

read more

Citations
More filters
Journal ArticleDOI

The calculi of emergence: computation, dynamics and induction

TL;DR: An overview of an inductive framework-hierarchical ϵ-machine reconstruction—in which the emergence of complexity is associated with the innovation of new computational model classes is presented, along with an analysis of the constraints on the dynamics of innovation.
Book

Abstract Algebra: Theory and Applications

TL;DR: The structure of groups and the sylow theorems of groups have been studied in the context of algebraic coding theory and cryptography as mentioned in this paper, with a focus on the use of Galois theory.
Journal ArticleDOI

Real-Time Warning System for Driver Drowsiness Detection Using Visual Information

TL;DR: A new module for Advanced Driver Assistance System (ADAS) for automatic driver drowsiness detection based on visual information and Artificial Intelligence is presented, to locate, to track and to analyze the face and the eyes to compute a drowsness index.
Posted Content

Discovering Noncritical Organization: Statistical Mechanical, Information Theoretical, and Computational Views of Patterns in One-Dimensional Spin Systems

TL;DR: This survey demonstrates that the measures of pattern from information theory and computational mechanics differ from known thermodynamic and statistical mechanical functions and argues that the information theoretic and computational mechanical analyses of spatial patterns capture the intrinsic computational capabilities in spin systems.
Journal ArticleDOI

Driver drowsiness warning system using visual information for both diurnal and nocturnal illumination conditions

TL;DR: A new module for Advanced Driver Assistance System (ADAS) which deals with automatic driver drowsiness detection based on visual information and Artificial Intelligence is presented.