Talk:Mealy machine

message: Fresheneesz has brought to my attention that "transducer" might be to broad a word in this case. I must admit that the only thing that I based my claim on "mealy machines" being transducers was on the finite state machine article. "Finite state transducer" is, of course, what I meant. Nevertheless, a quick google of "Finite state transducers" reveals that:
:Transducers  are automata that have transitions labeled with two symbols. One of the symbols represents input, the other - output. Transducers translate (or transduce) strings. In automata theory (see [HU79]) they are called Mealy's automata.
This seems to mean that mealy machines are the same thing with transducers. However, on the "Finite state machine" article on Wikipedia, it is said that Moore machines are also a FST.
Given that that some other references on the internet seem to say the same thing, I guess the FSM article should be changed in this way, I will post this matter on the FSM talk page, and see the result.
For now I will change this article accordingly. - Amenzix 22:48, 13 January 2007 (UTC)
replies: text: A Mealy machine is a deterministic transducer - I have added this to the article. It seems obvious enough not to need proof.Rp (talk) 15:35, 13 December 2012 (UTC)

text: Both are correct. See above. Rp (talk) 15:35, 13 December 2012 (UTC)
thread_title:  Transducer 

message: Hi. In example section simple example should be shown as a 6-tuple. I can't do it and ask for help. TIA. --Adam majewski (talk) 07:47, 1 October 2011 (UTC)
thread_title:  example 

message: This article is the only well known, Wiki-notable contribution of George Mealy. TYelliot | Talk  | Contribs 16:20, 16 April 2015 (UTC)
replies: text: Oppose merge. Although Mealy machines are his most famous contribution, it's untrue that they're his only notable contribution. I've expanded the Mealy article with other sourced contributions of Mealy and untagged it. —David Eppstein (talk) 04:20, 21 April 2015 (UTC)
thread_title:  Proposed merge with [[George H. Mealy]] 

message: I don't know a way to use a ROM to store machine state.
Masked ROMs do not contain flip-flops - I don't remember any type that does.
84.63.77.35 (talk) 07:56, 11 May 2015 (UTC)
thread_title:  ROM and combinatorial or not 

message: Prior content in this article duplicated one or more previously published sources. The material was copied from: http://www.cs.umd.edu/class/sum2003/cmsc311/Notes/Seq/impl.html. Copied or closely paraphrased material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.)
For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, and, if allowed under fair use, may copy sentences and phrases, provided they are included in quotation marks and referenced properly. The material may also be rewritten, providing it does not infringe on the copyright of the original or plagiarize from that source. Therefore, such paraphrased portions must provide their source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you.  —Ashley Y 02:24, 21 May 2015 (UTC)
thread_title:  Copyright problem removed