Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7449364> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Q7449364 subject Q7451612.
- Q7449364 subject Q7451918.
- Q7449364 abstract "In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function.Associated to any semiautomaton is a monoid called the characteristic monoid, input monoid, transition monoid or transition system of the semiautomaton, which acts on the set of states Q. This may be viewed either as an action of the free monoid of strings in the input alphabet Σ, or as the induced transformation semigroup of Q.In older books like Clifford and Preston (1967) S-acts are called "operands".In category theory, semiautomata essentially are functors.".
- Q7449364 wikiPageWikiLink Q11348.
- Q7449364 wikiPageWikiLink Q176452.
- Q7449364 wikiPageWikiLink Q176837.
- Q7449364 wikiPageWikiLink Q177251.
- Q7449364 wikiPageWikiLink Q184754.
- Q7449364 wikiPageWikiLink Q185813.
- Q7449364 wikiPageWikiLink Q189112.
- Q7449364 wikiPageWikiLink Q192161.
- Q7449364 wikiPageWikiLink Q207348.
- Q7449364 wikiPageWikiLink Q208237.
- Q7449364 wikiPageWikiLink Q217413.
- Q7449364 wikiPageWikiLink Q2303083.
- Q7449364 wikiPageWikiLink Q244761.
- Q7449364 wikiPageWikiLink Q2538404.
- Q7449364 wikiPageWikiLink Q2878974.
- Q7449364 wikiPageWikiLink Q3022116.
- Q7449364 wikiPageWikiLink Q3058244.
- Q7449364 wikiPageWikiLink Q3066095.
- Q7449364 wikiPageWikiLink Q321119.
- Q7449364 wikiPageWikiLink Q3321297.
- Q7449364 wikiPageWikiLink Q36161.
- Q7449364 wikiPageWikiLink Q378201.
- Q7449364 wikiPageWikiLink Q395.
- Q7449364 wikiPageWikiLink Q5204896.
- Q7449364 wikiPageWikiLink Q5500266.
- Q7449364 wikiPageWikiLink Q599031.
- Q7449364 wikiPageWikiLink Q670834.
- Q7449364 wikiPageWikiLink Q719395.
- Q7449364 wikiPageWikiLink Q727103.
- Q7449364 wikiPageWikiLink Q7449424.
- Q7449364 wikiPageWikiLink Q7451612.
- Q7449364 wikiPageWikiLink Q7451918.
- Q7449364 wikiPageWikiLink Q7623989.
- Q7449364 wikiPageWikiLink Q837518.
- Q7449364 wikiPageWikiLink Q837528.
- Q7449364 wikiPageWikiLink Q849775.
- Q7449364 wikiPageWikiLink Q864475.
- Q7449364 comment "In mathematics and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function.Associated to any semiautomaton is a monoid called the characteristic monoid, input monoid, transition monoid or transition system of the semiautomaton, which acts on the set of states Q.".
- Q7449364 label "Semiautomaton".