Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1126309> ?p ?o }
Showing triples 1 to 23 of
23
with 100 triples per page.
- Q1126309 abstract "In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. (This is in contrast to a Moore machine, whose output values are determined solely by its current state.)A Mealy machine is a deterministic finite state transducer: for each state and input, at most one transition is possible.".
- Q1126309 wikiPageWikiLink Q11348.
- Q1126309 wikiPageWikiLink Q1137726.
- Q1126309 wikiPageWikiLink Q1186179.
- Q1126309 wikiPageWikiLink Q1507472.
- Q1126309 wikiPageWikiLink Q150758.
- Q1126309 wikiPageWikiLink Q176452.
- Q1126309 wikiPageWikiLink Q2166395.
- Q1126309 wikiPageWikiLink Q230885.
- Q1126309 wikiPageWikiLink Q272404.
- Q1126309 wikiPageWikiLink Q3825295.
- Q1126309 wikiPageWikiLink Q41670.
- Q1126309 wikiPageWikiLink Q498186.
- Q1126309 wikiPageWikiLink Q5265707.
- Q1126309 wikiPageWikiLink Q599031.
- Q1126309 wikiPageWikiLink Q600590.
- Q1126309 wikiPageWikiLink Q640119.
- Q1126309 wikiPageWikiLink Q7330301.
- Q1126309 wikiPageWikiLink Q837518.
- Q1126309 wikiPageWikiLink Q844718.
- Q1126309 wikiPageWikiLink Q912887.
- Q1126309 comment "In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. (This is in contrast to a Moore machine, whose output values are determined solely by its current state.)A Mealy machine is a deterministic finite state transducer: for each state and input, at most one transition is possible.".
- Q1126309 label "Mealy machine".