Automata Theory and Formal Language

PythonTechTheoretical Computer ScienceLeave a comment

 In mathematics, computer science and linguistics, language theory aims to describe formal languages. A formal language is a set of words. The alphabet of a formal language is the set of symbols, letters or lexemes used to construct the words of language; Often, we suppose that this alphabet is finite. Words are sequences of elements of this alphabet; Words that belong to a particular formal language are sometimes called well-formed words or well-formed formulas. A formal language is often defined by a formal grammar, such as algebraic grammars and analyzed by automata.

Course Titles-----Authors
Formal Languages, Grammars, and Automa Alessandro Aldini
Formal Languages and Automata Theory GD. Goswami and K. V. Krishna
 Automata Theory and Languages  Mirian

 

Post Views: 3 046

Leave a Reply

Your email address will not be published. Required fields are marked *