hw07 - binary. [2,B] State : State 0: State 1: State 2: 2....

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

View Full Document Right Arrow Icon
CSE 460 - Computability and Formal Language Theory Homework 7 Due: 3PM, Thursday, October 25, 2007 This homework is based on material from Modules 14-17. 1. Describe the set of strings that end up in each state of the following FSA. Think
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: binary. [2,B] State : State 0: State 1: State 2: 2. Apply the 2FSA to 1 FSA construction for set union to the following two FSAs. [3,B] 1 2 1 1 1 1 M 1 1 2 1 1 1 1 M 1...
View Full Document

This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.

Page1 / 2

hw07 - binary. [2,B] State : State 0: State 1: State 2: 2....

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

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