![]() An example of a formal language is the set of all ``syntactically correct'' Pascal programs (accepted by a certain compiler).ĥ A main problem that we will discuss is how to define an infinite language in a finite way. A formal language is a set of strings where a string is a finite sequence of symbols. automata and formal languages appear (possibly in various disguises) in almost every branch of computer science. Upon completing this course the student will have learned, through appropriate classroom and laboratory experiences, the following: This course will give an introduction to formal languages and automata theory. ![]() Some knowledge of programming languages, and computer architecture will be helpful. The properties of these models will be studied and various rigorous techniques for analyzing and comparing them will be discussed, by using both formalism and examples.Ģ Course Objective The objective of this course is to give students a broad overview of the theoretical foundations of Computer Science, and to prepare students for the study of topics that depend upon an understanding of formal languages and automata.ģ Prerequisite The students are expected to have a strong background in the fundamentals of discrete mathematics (symbolic logic, set, induction, number theory, summation, series,combinatorics, graph, recursion, basic proof techniques, etc.), algorithms and data structures. ![]() compilers, software engineering, concurrent systems, etc. Not only do they form basic models of computation, they are also the foundation of many branches of computer science, e.g. ![]() 1 Introduction to Formal Languages and Automataĭescription: The course introduces some fundamental concepts in automata theory and formal languages including grammar, finite automaton, regular expression, formal language, pushdown automaton, and Turing machine. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
March 2023
Categories |