Finite Automata - Lecture 23, Lecture notes of Theory of Automata

Download Finite Automata - Lecture 23 and more Lecture notes Theory of Automata in PDF only on Docsity!

Lecture 23:

Finite Automata and Languages II

Discrete Mathematical Structures:

Theory and Applications

Learning Objectives

 Learn about various types of automata and

their basic properties

 Learn about regular grammars and their

relationship with various types of automata

 Become familiar with finite state machines

 Learn about various types of grammars

 (^) Suppose the cost of a newspaper is 25 cents. The machine accepts any sequence of 5-, 10-, or 25- cent coins. After inserting at least 25cents, the customer can press the button to release the newspaper. For simplicity, assume that if a customer inputs more than 25 cents, then the machine does not return the change. Moreover, after selling the newspaper, the machine returns to the initial state; i.e., it is ready to process the next request. Construct a finite state machine that models this vending machine.