flac-hw4 - FLAC Assignment 4 Exercise 1. Consider a class...

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

View Full Document Right Arrow Icon
FLAC Assignment 4 Exercise 1. Consider a class of automata in which the set of states is S = { 0 ,..., 7 } , the alphabet is Σ = { a , b } , the starting state is s 0 = 0, and the transition relation δ is given by: δ a b 0 5 4 1 4 4 2 1 0 3 0 1 4 7 7 5 6 7 6 3 2 7 3 3 a. Assign a set of final states F so that M = ( S, Σ ,s 0 ,δ,F ) is already a reduced automa- ton. b. Assign a set of final states F , where ∅ 6 = F 6 = S , so that M reduces to the smallest possible automaton. Exercise 2. We say that an equivalence relation E on Σ * is invariant iff for all u,v Σ * , wE w 0 ( uwv ) E ( uw 0 v ). Prove that L Σ * is a regular language iff there is an invariant equivalence relation E of finite index 1 such that w L ⇒ { w 0 | w E w 0 } ⊆ L . Exercise 3. Prove that the following language is regular: The set of sequences of 1000 × 1000 binary matrices that, when multiplied together modulo 2, yield the 1000 × 1000 identity matrix I = 1 0 ··· 0 0 1 ··· 0 . . . . . . . . . . . . 0 0
Background image of page 1

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

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

Page1 / 2

flac-hw4 - FLAC Assignment 4 Exercise 1. Consider a class...

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