G abbb aaaab aabb abab notanon is the empty string

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ges •  Example: –  Language: L = { a+b+ } “one or more a’s followed by one or more b’s” •  L is a regular language –  described by a regular expression •  Note: –  infinite set of strings belonging to language L »  e.g. abbb, aaaab, aabb, *abab, *λ •  NotaNon: –  λ is the empty string (or string with zero length), someNmes ε is used instead –  * means string is not in the language Finite State Automata (FSA) •  L = { a+b+ } can be also be generated by the following FSA > s a   > Indicates start state   Red circle indicates end (accepNng) state   we accept a input string only when we’re in an end state and we’re at the end of the string x a y b b Finite State Automata (FSA) •  L = { a+b+ } can be also be generated by the following FSA > s a x a y b b Finite State Automata (FSA) •...
View Full Document

Ask a homework question - tutors are online