lect1-intro

lect1-intro - WelcometoCS154 WhyStudyAutomata?...

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

View Full Document Right Arrow Icon
1 Welcome to CS154 Why Study Automata? What the Course is About Administrivia
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Why Study Automata? A survey of Stanford grads 5 years out  asked which of their courses did they  use in their job. Basics like CS106 took the top spots, of  course. But among optional courses, CS154  stood remarkably high. 3X the score for AI, for example.
Background image of page 2
3 How Could That Be? Regular expressions are used in many  systems. E.g., UNIX  a.*b . E.g., DTD’s describe XML tags with a RE  format like  person (name, addr, child*) . Finite automata model protocols,  electronic circuits. Theory is used in  model-checking .
Background image of page 3

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

View Full DocumentRight Arrow Icon
How? – (2) Context-free grammars are used to  describe the syntax of essentially every  programming language. Not to forget their important role in  describing natural languages. And DTD’s taken as a whole, are really 
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 15

lect1-intro - WelcometoCS154 WhyStudyAutomata?...

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

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