ECE 3541 Digital State Machines -Syllabus

ECE 3541 Digital - ECE 3541 DIGITAL STATE MACHINES CRN 53318 Introduces theory of Finite Automata Finite State Machines that are very useful and

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

View Full Document Right Arrow Icon
ECE 3541 DIGITAL STATE MACHINES CRN 53318 Introduces theory of Finite Automata, Finite State Machines that are very useful and important to model many kinds of hardware and software systems: 1. Software for designing and checking the behavior of digital circuits. 2. The "lexical analyzer" of a typical compiler, that is, the compiler component that breaks the input text into logical units, such as identifiers, keywords, and punctuation. 3. Software for scanning and interpreting large bodies of text, such as collections of Web pages, to find occurrences of words, phrases, or other patterns. 4. Speech recognition and Text to speech software, that requires natural language model component to perform accurate predication and matching of the input acoustic stream in speech recognition, and correcting errors in text for text-to- speech. 5. Software for verifying systems of all types that have a finite number of distinct states, such as communications protocols or protocols for secure exchange of information. Topics:
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.

This note was uploaded on 02/10/2012 for the course ECE 3541 taught by Professor Staff during the Fall '10 term at FIT.

Page1 / 3

ECE 3541 Digital - ECE 3541 DIGITAL STATE MACHINES CRN 53318 Introduces theory of Finite Automata Finite State Machines that are very useful and

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