Formal Language Automata
( FLA )
G. H. Raisoni college of engineering nagpur previous year question paper
Question paper given at the bottom of the page
Syllabus
Unit 1:- introduction
- Basic mathematical notation and techniques
- Finite state system
- Basic defination Finite automata (FA) ,NFA &NDFA
- Regular language expression
- Equavalence of NFA &DFA
- Finite automata and Regular Expression
- Application of Regular Expression
- Algebraic lows for regular expression
- Property of regular language
- Pumping lemmna
- Application of pumping lemmna
- Clossure property of regular language
- Decision property of regular language
Unit 3
- Context free grammar
- Application of context free grammar
- Leafmost and rightmost derivation
- Ambiguity in grammar language and push down automata
- Equivalence PDA and GFC and Deterministic pushdown Automata
Unit 4
- Turing machine
- Computable language and functions
- ..
Important Topics For the EXAM
- 1)Block diagram
- 2)Discrete model
- 3)Application of FA ,NFA VS DFA
- 4) FA, PDA,LBA
- 4)Conversion NFA to DFA
- 5)Minimization of DFA
- 6)Conversion of NFA to DFA
- Reguler Expression -
- (Language to Regular
- Language to Find FA)
- 7) Finite automata to machine accepicbidity of string
- Mealey & Moore machine
- 8) turing machine
A Finite Automaton is defined as follows:
An automaton can be represented by 5 symbol (Q, ∑, δ, q0, F)
Q :- is a finite set of states.
∑ :- finite set of symbols.
∑ (a,b)
δ :- is the transition function.
q0:-is the starting point.
F :- is a set of final state
Smallest unit of language known as symbol
Symbol :-{ a,b,c,d,0,1,2,3,4,5}
∑ :- alphabet (a,b)
String :- collection of alphabet
Example :- {aa,ab,bc,ca}
Example:- aa is a string then the length of string is 2
If the length of string is 3 and alphabet (a,b) then the string is {aaa,aab,aba,baa ........bbb}
Language :- collection of string is known as language
Length of string :- number of alphabet in string
To understand what formal language automata are, we have to look at how language is formed.
First, understand that a symbol means a,b,c...or 0,1,2,3... by which we can represent a language, so the definition of a symbol is the smallest unit of a language known as a symbol.
Just like when we write English, we use the alphabet here too, but here we use the alphabet and represent it with the summation symbol '∑'.
It comes after this string. Now consider how to define a string.A collection of characters is known as a "string." Because a or b are alphabets, their collection stringFor example, if aa is one string, 'ab' becomes another string.
'bb' becomes the third string.
The length of a string is given. string ' aa ' has two alphabets, so its length is two.
If we get the condition that the length of the string is 3 alphabets
(a, b, c), then the string { aaaa, abc, aab, aac....ccc } be formed.
Let's look at another example.
Given a string length of 4 and only the alphabet (a, b), then the string become {aaaa, aaab, aabb, abbb, bbbb...}
It will be like this
Let's understand what language is. Let's see what the function of using formal language is.
You are learning computers. You know the C language. For coding we use c language, python, java, c++, but why we don't use english or our mother tongue to understand computer, because computer can't understand that language, so we train computer in its language, whereas formal language means we train computer in some language. (c,c++, etc.) and the computer itself is creating itself by implementing that language.
There are three types of language. Finite language, infinite language, and null
A finite language is
A string of length two, as in the example,
aa,ab,bb
An infinite language is a string containing at least one a.
{a, a, aa, aaa, aaaa,aa....
ab, aabb, aaab.....}
It is infinite.
And null means nothing.
An automaton is a machine that determines whether or not a language exists. The first three language types are finite, infinite, and null.
Consider the case of a language.
aaa,abc,abb,acc,bbc,bcc and see if the language is supported.
At least one a must be present in the length of the string. As you can see, there are two strings that are not accepted: bbc and bcc. The given language is therefore not a formal language.
Furthermore, we can observe that this language does not meet the provided requirement, indicating that it is not a formal language. Even if the language is limitless and unreadable, automata come into play. The automata determine if the condition is accepted by the language.
Following that is grammar. Just like you would use proper syntax when writing a sentence in the past or future tense. Grammar is also required to utilise formal language correctly.
How to download this image ?
Step 1: - First you click on the image
Step 2: - After the first step you will see the image completely clear, then you long press on to the image
Step 3: - After that you will get an option list. In that list click on download image option and your image will start downloading.
CAE-2 SUMMER-2021 (ONLINE MODE)
Forth Semester B.E.
FLA (Formal Language Automata)
CAE-1 SUMMER-2021
Forth Semester B.E.
END SEMESTER EXAMINATION
SUMMER-2021 (ONLINE MODE)
Forth Semester B.E.
Join WhatsApp
Click here
Join Telegram
Click here
All 2nd year previous year question papers available on the below link
Click on the below link
Dear friends, Welcome to my website, classmate2022. My name is Harshad Nichat and I am also studying in the 3rd year AI branch A section at G.H. Raisoni College of Engineering, Nagpur.
I want to tell you that all the previous year's question papers for the first, second, and third years of G.H. Raisoni College of Engineering, Nagpur have been uploaded. My only purpose behind creating this website or behind uploading the paper is so that everyone can get previous year question papers because I was in 1st year too and I also wanted the paper because, after seeing the previous year question papers, we know the background of that question paper or what type of paper it is. Thus, it helps to know what types of questions will come, and thus your end of semester exam results are good. Another thing is that some questions from previous year's question papers are repeated in your exam, so it is necessary to get previous year's question papers. I am not getting any profit if I do paper work. I am doing paper work only because my hobby is helping others and I am doing it.
If you are also willing to help me, then give me your feedback. How do you like this site? Tell us about what else needs to be implemented in and share the link to this site with your friends and in your group so that everyone can get the previous year's questions paper. Get the papers and, if possible,
send me your CAE-1 & 2 END SEM question papers, which will help the students who will take admission next year.