Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Finite-state_machine> ?p ?o. }
Showing items 1 to 66 of
66
with 100 items per page.
- Finite-state_machine abstract "A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is a mathematical model of computation used to design both computer programs and sequential logic circuits. It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state. It can change from one state to another when initiated by a triggering event or condition; this is called a transition. A particular FSM is defined by a list of its states, and the triggering condition for each transition.The behavior of state machines can be observed in many devices in modern society which perform a predetermined sequence of actions depending on a sequence of events with which they are presented. Simple examples are vending machines which dispense products when the proper combination of coins is deposited, elevators which drop riders off at upper floors before going down, traffic lights which change sequence when cars are waiting, and combination locks which require the input of combination numbers in the proper order.Finite-state machines can model a large number of problems, among which are electronic design automation, communication protocol design, language parsing and other engineering applications. In biology and artificial intelligence research, state machines or hierarchies of state machines have been used to describe neurological systems and in linguistics—to describe the grammars of natural languages.Considered as an abstract model of computation, the finite state machine is weak; it has less computational power than some other models of computation such as the Turing machine. That is, there are tasks which no FSM can do, but some Turing machines can. This is because the FSM has limited memory. The memory is limited by the number of states.FSMs are studied in the more general field of automata theory.".
- Finite-state_machine thumbnail Turnstile_state_machine_colored.svg?width=300.
- Finite-state_machine wikiPageExternalLink foldoc.cgi?query=finite+state+machine.
- Finite-state_machine wikiPageExternalLink tab2.
- Finite-state_machine wikiPageExternalLink 141.pdf.
- Finite-state_machine wikiPageExternalLink Moore_Finite_State_Machine_Control_Circuit.
- Finite-state_machine wikiPageExternalLink modeling-a-simple-ai-behavior-using-a-finite-state-machine.
- Finite-state_machine wikiPageExternalLink en.
- Finite-state_machine wikiPageExternalLink finiteStateMachine.html.
- Finite-state_machine wikiPageExternalLink index.php.
- Finite-state_machine wikiPageExternalLink index.php.
- Finite-state_machine wikiPageExternalLink TN10-Moore-Or-Mealy-Model.
- Finite-state_machine wikiPageExternalLink cogs.
- Finite-state_machine wikiPageID "10931".
- Finite-state_machine wikiPageRevisionID "605408630".
- Finite-state_machine hasPhotoCollection Finite-state_machine.
- Finite-state_machine subject Category:Automata_theory.
- Finite-state_machine subject Category:Digital_electronics.
- Finite-state_machine subject Category:Models_of_computation.
- Finite-state_machine type Assistant109815790.
- Finite-state_machine type CausalAgent100007347.
- Finite-state_machine type LivingThing100004258.
- Finite-state_machine type Model110324560.
- Finite-state_machine type ModelsOfComputation.
- Finite-state_machine type Object100002684.
- Finite-state_machine type Organism100004475.
- Finite-state_machine type Person100007846.
- Finite-state_machine type PhysicalEntity100001930.
- Finite-state_machine type Whole100003553.
- Finite-state_machine type Worker109632518.
- Finite-state_machine type YagoLegalActor.
- Finite-state_machine type YagoLegalActorGeo.
- Finite-state_machine type Genre.
- Finite-state_machine type MusicGenre.
- Finite-state_machine type TopicalConcept.
- Finite-state_machine type Concept.
- Finite-state_machine comment "A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is a mathematical model of computation used to design both computer programs and sequential logic circuits. It is conceived as an abstract machine that can be in one of a finite number of states. The machine is in only one state at a time; the state it is in at any given time is called the current state.".
- Finite-state_machine label "Automa a stati finiti".
- Finite-state_machine label "Automat skończony".
- Finite-state_machine label "Automate fini".
- Finite-state_machine label "Autómata finito".
- Finite-state_machine label "Eindigetoestandsautomaat".
- Finite-state_machine label "Endlicher Automat".
- Finite-state_machine label "Finite-state machine".
- Finite-state_machine label "Máquina de estados finitos".
- Finite-state_machine label "Конечный автомат".
- Finite-state_machine label "آلة الحالات المحدودة".
- Finite-state_machine label "有限オートマトン".
- Finite-state_machine label "有限状态机".
- Finite-state_machine sameAs Konečný_automat.
- Finite-state_machine sameAs Endlicher_Automat.
- Finite-state_machine sameAs Autómata_finito.
- Finite-state_machine sameAs Automate_fini.
- Finite-state_machine sameAs Automa_a_stati_finiti.
- Finite-state_machine sameAs 有限オートマトン.
- Finite-state_machine sameAs 유한_상태_기계.
- Finite-state_machine sameAs Eindigetoestandsautomaat.
- Finite-state_machine sameAs Automat_skończony.
- Finite-state_machine sameAs Máquina_de_estados_finitos.
- Finite-state_machine sameAs m.02ykc.
- Finite-state_machine sameAs Q176452.
- Finite-state_machine sameAs Q176452.
- Finite-state_machine sameAs Finite-state_machine.
- Finite-state_machine wasDerivedFrom Finite-state_machine?oldid=605408630.
- Finite-state_machine depiction Turnstile_state_machine_colored.svg.
- Finite-state_machine isPrimaryTopicOf Finite-state_machine.