Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
13Activity

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
Finite Automata Course Notes by Mark V. Lawson

Finite Automata Course Notes by Mark V. Lawson

Ratings: (0)|Views: 399 |Likes:
Published by Peter_Shook
by Mark V. Lawson
http://www.ma.hw.ac.uk/~markl/teaching/AUTOMATA/kleene.pdf
by Mark V. Lawson
http://www.ma.hw.ac.uk/~markl/teaching/AUTOMATA/kleene.pdf

More info:

Published by: Peter_Shook on Jul 14, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

07/10/2013

pdf

text

original

 
Finite Automata
Mark V. LawsonHeriot-Watt University, EdinburghNovember 4, 2009
 
Contents
Preface vii1 Introduction to nite automata 1
1.1 Alphabets and strings . . . . . . . . . . . . . . . . . . . . . . 11.2 Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71.3 Language operations . . . . . . . . . . . . . . . . . . . . . . . 91.4 Finite automata: motivation . . . . . . . . . . . . . . . . . . . 141.5 Finite automata and their languages . . . . . . . . . . . . . . 171.6 Summary of Chapter 1 . . . . . . . . . . . . . . . . . . . . . . 25
2 Recognisable languages 27
2.1 Designing automata . . . . . . . . . . . . . . . . . . . . . . . . 272.2 Automata over one letter alphabets . . . . . . . . . . . . . . . 302.3 Incomplete automata . . . . . . . . . . . . . . . . . . . . . . . 322.4 Automata that count . . . . . . . . . . . . . . . . . . . . . . . 362.5 Automata that locate patterns . . . . . . . . . . . . . . . . . . 412.6 Boolean operations . . . . . . . . . . . . . . . . . . . . . . . . 452.7 Summary of Chapter 2 . . . . . . . . . . . . . . . . . . . . . . 51
3 Non-deterministic automata 53
3.1 Accessible automata . . . . . . . . . . . . . . . . . . . . . . . 533.2 Non-deterministic automata . . . . . . . . . . . . . . . . . . . 603.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683.4 Summary of Chapter 3 . . . . . . . . . . . . . . . . . . . . . . 71
4
ε
-automata 73
4.1 Automata with
ε
-transitions . . . . . . . . . . . . . . . . . . . 734.2 Applications of 
ε
-automata . . . . . . . . . . . . . . . . . . . . 79iii

Activity (13)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
CHANDRA BHUSHAN liked this
Shahid Ali liked this
Khalil Mihoubi liked this
Harish Shan liked this
Harish Shan liked this
rajaramansuresh liked this
akbisoi1 liked this

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->