Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Semiautomaton> ?p ?o }
Showing triples 1 to 69 of
69
with 100 triples per page.
- Semiautomaton 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.".
- Semiautomaton wikiPageID "10766937".
- Semiautomaton wikiPageLength "9455".
- Semiautomaton wikiPageOutDegree "51".
- Semiautomaton wikiPageRevisionID "686944757".
- Semiautomaton wikiPageWikiLink Alphabet_(formal_languages).
- Semiautomaton wikiPageWikiLink Associative_property.
- Semiautomaton wikiPageWikiLink Category:Category_theory.
- Semiautomaton wikiPageWikiLink Category:Finite_automata.
- Semiautomaton wikiPageWikiLink Category:Semigroup_theory.
- Semiautomaton wikiPageWikiLink Category_(mathematics).
- Semiautomaton wikiPageWikiLink Category_theory.
- Semiautomaton wikiPageWikiLink Complex_projective_space.
- Semiautomaton wikiPageWikiLink DFA_minimization.
- Semiautomaton wikiPageWikiLink De_Bruijn_graph.
- Semiautomaton wikiPageWikiLink Deterministic_finite_automaton.
- Semiautomaton wikiPageWikiLink Empty_string.
- Semiautomaton wikiPageWikiLink Finite-state_machine.
- Semiautomaton wikiPageWikiLink Formal_language.
- Semiautomaton wikiPageWikiLink Free_monoid.
- Semiautomaton wikiPageWikiLink Function_(mathematics).
- Semiautomaton wikiPageWikiLink Function_composition.
- Semiautomaton wikiPageWikiLink Functor.
- Semiautomaton wikiPageWikiLink Identity_element.
- Semiautomaton wikiPageWikiLink Identity_function.
- Semiautomaton wikiPageWikiLink Isomorphism.
- Semiautomaton wikiPageWikiLink Kleene_star.
- Semiautomaton wikiPageWikiLink Mathematics.
- Semiautomaton wikiPageWikiLink Monoid.
- Semiautomaton wikiPageWikiLink Quantum_finite_automata.
- Semiautomaton wikiPageWikiLink Qubit.
- Semiautomaton wikiPageWikiLink Semigroup.
- Semiautomaton wikiPageWikiLink Semigroup_action.
- Semiautomaton wikiPageWikiLink Set_(mathematics).
- Semiautomaton wikiPageWikiLink State_(computer_science).
- Semiautomaton wikiPageWikiLink State_transition_table.
- Semiautomaton wikiPageWikiLink String_(computer_science).
- Semiautomaton wikiPageWikiLink String_operations.
- Semiautomaton wikiPageWikiLink Symmetric_space.
- Semiautomaton wikiPageWikiLink Syntactic_monoid.
- Semiautomaton wikiPageWikiLink Theoretical_computer_science.
- Semiautomaton wikiPageWikiLink Transformation_semigroup.
- Semiautomaton wikiPageWikiLink Unitary_matrix.
- Semiautomaton wikiPageWikiLinkText "Semiautomaton".
- Semiautomaton wikiPageWikiLinkText "semiautomata".
- Semiautomaton wikiPageWikiLinkText "semiautomaton".
- Semiautomaton date "April 2014".
- Semiautomaton reason "No 'free group' was mentioned before; probably, the free monoid of all strings is meant instead? The construction of transitions appears to be a process, so how can it have a 'depiction as ... graphs'?".
- Semiautomaton wikiPageUsesTemplate Template:Clarify.
- Semiautomaton wikiPageUsesTemplate Template:Main.
- Semiautomaton subject Category:Category_theory.
- Semiautomaton subject Category:Finite_automata.
- Semiautomaton subject Category:Semigroup_theory.
- Semiautomaton hypernym Automaton.
- Semiautomaton type Language.
- Semiautomaton type Combinatoric.
- Semiautomaton type Function.
- Semiautomaton type Language.
- Semiautomaton type Page.
- Semiautomaton 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.".
- Semiautomaton label "Semiautomaton".
- Semiautomaton sameAs Q7449364.
- Semiautomaton sameAs نیم_اتوماتون.
- Semiautomaton sameAs Semi_autômato.
- Semiautomaton sameAs m.02qpcw_.
- Semiautomaton sameAs Q7449364.
- Semiautomaton sameAs 半自动机.
- Semiautomaton wasDerivedFrom Semiautomaton?oldid=686944757.
- Semiautomaton isPrimaryTopicOf Semiautomaton.