CS241 Study Guide - Substring, Empty String

31 views3 pages
8 Oct 2014
Course
Professor

Document Summary

An alphabet (denoted ) is a nite set of symbols. Example: {a, b, c, {b, {to, be, or, not, {0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f} A word (over an alphabet ) is nite sequence of symbols from . Example: bac, aba, c given that = {a, b, c, ,b, bb, bbb given that = {b, to be or not to be, not to be (one word formed from the alpha- bet) = {to, be, or, not: deadbeef, face given that = {0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f} Example: nite languages, regular languages (languages that can be recognized by a dfa, A deterministic finite automata (dfa) is a 5-tuple ( , q, q0, a, ) where: Q nite set of states q0 q a starting state in the set of states. A q set of accepting states. : q q the transition function. Draw the dfa for the following exercises: l = all strings composed from except the empty string . = {a, b, c: l = { }

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions