Xem mẫu
- Lecture # 6
Theory Of Automata
By
Dr. MM Alam
- Lecture#5 Recap
•
Introduction to Finite Automata
•
Finite Automata representation using
Transition tables and using graphs
•
Finite Automata examples
- a a,b
0
b 1
- •
Given an input string, an FA will either
accept or reject the input based on the
following:
– If final state is reached after reading the
string, the FA will accept the string
– If the final state is not reachable after reading
the individual symbols of a string, then FA will
reject the string.
- Construct a regular expression and
correspondingly an FA for all words in which
a appears tripled, if at all.
• The regular expression is as follows:-
•
(aaa+b)*
a, b
1- a 2 a 3
a 5+
a,b
b b b
4+ a,b 6
- Construct a regular expression and
correspondingly an FA for all strings that
end in a double letter.
• The regular expression is as follows:-
•
(a+b)*(aa+bb) a
a
1- 1 2+
b a
a b
b b
a
4+ b 3+
- L1 = The language of strings, defined over
Σ={a, b}, beginning with b
a,b
b
–– +
a a,b
- 1
The language of strings, defined over
Σ={a, b}, not beginning with a
. a,b
b +2
1
a
a,b
3
- •
JLFAP provides a Hands-on Approach to
Formal Languages and Automata.
•
JLFAP = Java Formal Languages and
Automata Package
•
It is an Instructional tool to learn concepts
of Formal Languages and Automata
Theory
•
Topics:
– Regular Languages (Finite Automata,
- Lecture#6 Summary
•
Finite Automata examples corrections
•
JFLAP Introduction
•
Practical Demonstration of JFLAP
nguon tai.lieu . vn
