Formal Languages and Automata Theory

Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.Covers automata theory, formal language theory, grammars, and combinatorics on words. This roughly corresponds to ACM Subject Classes F.1.1, and F.4.3. Papers dealing with computational complexity should go to cs.CC; papers dealing with logic should go to cs.LO.
相关学科: Logic in Computer ScienceFinite AutomataComputational ComplexityDiscrete MathematicsDFATemporal LogicTranslationNLPGrammatical InferenceProgramming Languages









David Haussler

210533 被引用,548 篇论文

Toby J. Gibson

155463 被引用,178 篇论文

Lotfi A. Zadeh

128623 被引用,362 篇论文

Claude E. Shannon

121827 被引用,63 篇论文

Sean R. Eddy

109384 被引用,166 篇论文

Noam Chomsky

92927 被引用,713 篇论文

Robert E. Schapire

76454 被引用,259 篇论文

S. Shankar Sastry

70326 被引用,894 篇论文

Charles H. Bennett

64343 被引用,117 篇论文

Rajeev Motwani

63749 被引用,263 篇论文