Finite-state machine
flowchart AA["Associated Authors (0)"] C[Finite-state machine] BC["Broader Concepts (2)"] NC["Narrower Concepts (8)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q176452
- OpenAlex ID
- https://openalex.org/C167822520 (API record)
- OpenAlex Description
- mathematical model of computation; abstract machine that can be in exactly one of a finite number of states at any given time
- OpenAlex Level [?]
- 2
Broader Concepts
Narrower Concepts
- Abstract state machines
- Deterministic automaton
- Deterministic finite automaton
- Extended finite-state machine
- Probabilistic automaton
- Pushdown automaton
- State diagram
- Timed automaton
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.