Since I will be mostly looking Finite Automata, then a I mention briefly what a Regular Language is.Ī Regular Language is a language which is constrained by the rules of regular grammar all finite languages are regular, and all languages which can be accepted by a finite automation are regular, since finite automata only has a finite amount of memory, it isn’t able to recognise a set of strings which has a arbitrary number of 0’s or 1’s.Ī classic example of a regular language which can’t be accepted by finite automata is: In mathematical terms, the formal language can be defined as follows:Ī language is a set of all the possible words or strings which can be generated from that finite alphabet. These rules may be regular grammar which forms the basis of regular languages, which are recongised by finite automata machines. I’ll introduce the terms of strings and alphabets shortly. So what is the formal definition of a Formal Language?Ī formal language is a set of strings over a given alphabet with some form of rules applied to this strings. For example, Finite Automata can only recognise Regular Languages and not Context-Free Languages. The hierarchy gives the types of languages classes, and what machines they can be computed by.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |