About this document
Moore vs Mealy Machines & Grammars by Manohar is a document available to read on EtoBox.
The document compares Moore machines and Mealy machines, ambiguous and unambiguous grammars, and Chomsky normal form and Greibach normal form. Moore machines output depends only on present state while Mealy machines output depends on present state and input. Ambiguous grammars generate more than one parse tree while unambiguous grammars generate exactly one parse tree.
- Author
- Manohar
- Language
- EN