bn:03116203n
Noun Concept
Categories: Automata (computation), Theoretical computer science stubs
EN
deterministic automaton  deterministic computation
EN
In computer science, a deterministic automaton is a concept of automata theory where the outcome of a transition from one state to another is determined by the input. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a deterministic automaton is a concept of automata theory where the outcome of a transition from one state to another is determined by the input. Wikipedia
concept of automata theory in which the outcome of a transition from one state to another is determined by the input Wikidata
Wikipedia Redirections