전기전자기초실험 FSM(Finite State Machine) Design 결과보고서
- 최초 등록일
- 2009.09.08
- 최종 저작일
- 2009.06
- 13페이지/
한컴오피스
- 가격 1,000원
소개글
연세대학교 전기전자기초실험 11장 보고서(영문)
다른 chapter는 제 박스에서 검색해주세요.
참고자료로 사용하세요
목차
- Objective
- Procedure
- Report
본문내용
- Report
1. Search on the some circuits using Mealy machine and Moore machine
Mealy machine
In the theory of computation, a Mealy machine is a finite state transducer that generates an output based on its current state and input. This means that the state diagram will include both an input and output signal for each transition edge. In contrast, the output of a Moore finite state machine depends only on the machine`s current state; transitions are not directly dependent upon input. However, for each Mealy machine there is an equivalent Moore machine.
Mealy machines provide a rudimentary mathematical model for cipher machines. Considering the input and output alphabet the Latin alphabet, for example, then a Mealy machine can be designed that given a string of letters (a sequence of inputs) can process it into a ciphered string (a sequence of outputs). However, although you could use a Mealy model to describe the Enigma, the state diagram would be too complex to provide feasible means of designing complex ciphering machines.
참고 자료
♣ Electric Circuit Experiment : Logic Circuit
♣ Contemporary Logic Design 2nd Edition (Randy H. Katz)
