(Java Formal Languages and Automata Package) And Turing Machine

1. Abdulwahab M.Saleh

2. TURING MACHINE
Abdulwahab M.Saleh

3. WHAT IS THE TURING MACHINE?
Turing machines are an abstract model of
computation.
mathematical model ofis aTuring machineA
.machineabstractthat defines ancomputation

4. WHO IS THE
INVENTOR OF
THE TURING
MACHINE

5. THE MATHEMATICIAN ALAN TURING IN 1936

9. JFLAP
(JAVA FORMAL LANGUAGES AND AUTOMATA PACKAGE)
forJavasoftware written ineducationalis
areacomputer scienceexperimenting with topics in the
.theoryautomataandformal languagesof

13. TRANSITION TABLE

14. Present
States
Tape Symbol
a b B
q0 aRq0 bLq0 BLq1
q1 - - -

24. CONCLUSION
In this machine each string start with ‘a’ followed by
‘b’ will enters the machine in infinite loop .
Each string start with ‘a’ and not content ‘b’ i.e. “aaa”
will accept

25. Abdulwahab Mahdi Saleh
Iraq