1 / 12

Lecture 18: Language, Finite State Machine

JC Liu. MACM101 Discrete Mathematics I. 18.1. Language: Set theory of strings. Alphabet: A nonempty finite set of symbols, SS={0,1}, S={a,b,c,d,e}Power of SRecursive definitionS1= SSn 1={xy | x in S, y in Sn} xy is the juxtaposition of x and yE.g., S={0,1}, then S2={00,01,10,11}How many in

chandler
Download Presentation

Lecture 18: Language, Finite State Machine

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    More Related