The Mealy in Moore conversion of an automaton [articol]

dc.contributor.author	Hriţcu, Alioșa V.
dc.date.accessioned	2020-04-28T07:10:21Z
dc.date.accessioned	2021-03-01T08:37:27Z
dc.date.available	2020-04-28T07:10:21Z
dc.date.available	2021-03-01T08:37:27Z
dc.date.issued	2006
dc.identifier.citation	Hriţcu, Alioșa V.. The Mealy in Moore conversion of an automaton. Timişoara: Editura Politehnica, 2006	en_US
dc.identifier.uri	http://primo.upt.ro:1701/primo-explore/search?query=any,contains,The%20Mealy%20in%20Moore%20conversion%20of%20an%20automaton&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo
dc.description.abstract	This article presents a new demonstration of the Mealy in Moore conversion theorem and a new matrix algoritm witch, just manually, can be easy realised for automatons with a great number of internal states. The Mealy in Moore conversion is a stage in the logical synthesis of a Mealy automaton using, for example, programmable logic arrays or delays.	en_US
dc.language.iso	en	en_US
dc.publisher	Timişoara:Editura Politehnica	en_US
dc.relation.ispartofseries	Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 51(65), fasc. 1 (2006), p. 188-190
dc.title	The Mealy in Moore conversion of an automaton [articol]	en_US
dc.type	Article	en_US