JFLAP
1 like•300 views
The Turing machine is an abstract model of computation invented by mathematician Alan Turing in 1936. It is a mathematical model of a machine that defines computation. JFLAP is educational software written in Java for experimenting with topics in automata theory and formal languages. The Turing machine uses a transition table to change states based on the present state and tape symbol, putting strings starting with 'a' followed by 'b' into an infinite loop and accepting strings starting with 'a' not containing 'b'.
1 of 25
Downloaded 11 times
More Related Content
Recently uploaded (20)
Ad
Featured (20)
PDF
Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...OECD Directorate for Financial and Enterprise AffairsPDF
Social Media Marketing Trends 2024 // The Global Indie InsightsKurio // The Social Media Age(ncy)Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...OECD Directorate for Financial and Enterprise Affairs
Ad
JFLAP
- 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