Nondeterministic finite automaton
flowchart AA["Associated Authors (0)"] C[Nondeterministic finite automaton] BC["Broader Concepts (1)"] NC["Narrower Concepts (6)"] 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/Q617295
- OpenAlex ID
- https://openalex.org/C158008952 (API record)
- OpenAlex Description
- finite-state machine
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Block cellular automaton
- Continuous automaton
- DFA minimization
- Deterministic pushdown automaton
- Reversible cellular automaton
- Two-way deterministic finite automaton
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.