deterministic finite automata (Q837528)
Jump to navigation
Jump to search
finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string
- DFA
- deterministic finite acceptor
- deterministic finite state machine
- DFSM
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | deterministic finite automata |
finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string |
|
Statements
DEA (German)
0 references
DFA (English)
0 references
ДКА (Russian)
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(26 entries)
- arwiki أتمتة محدودة قطعية
- bswiki Deterministički konačni automat
- cawiki Autòmat finit determinista
- dewiki Deterministischer endlicher Automat
- elwiki Ντετερμινιστικό πεπερασμένο αυτόματο
- enwiki Deterministic finite automaton
- eswiki Autómata finito determinista
- fawiki پذیرنده متناهی معین
- frwiki Automate fini déterministe
- hewiki אוטומט סופי דטרמיניסטי
- hrwiki Deterministički konačni automat
- huwiki Determinisztikus véges állapotú gép
- itwiki Automa a stati finiti deterministico
- jawiki 決定性有限オートマトン
- kowiki 결정론적 유한 상태 기계
- lvwiki Galīgs determinēts automāts
- nowiki Deterministisk endelig tilstandsmaskin
- plwiki Deterministyczny automat skończony
- ptwiki Autômato finito determinístico
- ruwiki Детерминированный конечный автомат
- shwiki Deterministički konačni automat
- srwiki Детерминистички коначни аутомат
- trwiki Deterministik sonlu durum makinesi
- ukwiki Детермінований скінченний автомат
- zh_yuewiki 決定性有限狀態機
- zhwiki 确定有限状态自动机