03-regular-languages-NFA

03-regular-languages-NFA - Regular Languages Denition: A...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Regular Languages Definition: A language is called a regular language if some finite automaton recognizes it – p. 1/2 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Regular Operations Definition: Let A and B be regular languages, we define the following operations: Union: A B = { x | x A or x B } . Concatenation: A B = { xy | x A and y B } . Star (Kleene Closure): A * = { x 1 x 2 . . . x k | k 0 and each x i A } . – p. 2/2 1
Background image of page 2
A B is a Regular Language Theorem: If A 1 and A 2 are regular languages, then so is A B . – p. 3/2 1
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A B is a Regular Language – p. 4/2 1
Background image of page 4
Nondeterminism Up to now we have only considered machines where, given a state and given an input symbol, the next state is uniquely defined - deterministic machines (DFA) However, we could conceive of machines that, given a state and a particular input symbol, have a choice of states to move to - nondeterministic machines (NFA) We will see that nondeterminism does not add to the power of the NFA to recognize larger sets of languages, but nondeterminism adds to the expressiveness of the machines, i.e., it is much easier to build a nondeterministic machine for a particular regular language than a deterministic machine. – p. 5/2 1
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: Let A be the language consisting of all string over Σ = { 0 , 1 } containing a 1 in the third position from the end (e.g. 00100 , 0101 , 1100 A ). DFA:
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course CSC 544 taught by Professor Staff during the Spring '11 term at Rhode Island.

Page1 / 21

03-regular-languages-NFA - Regular Languages Denition: A...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online