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

Pronunciations

• British English

  /dɪˌtɜːmɪˈnɪstɪk ˈfaɪnaɪt ˌɔːtəˈmɑːtə/Open converter

• American English

  /dɪˌtɝməˈnɪstɪk ˈfaɪˌnaɪt ɑˈtɑmətə/Open converter

These IPA transcriptions are generated from the name above. Proper names may have other pronunciations, and current converter results may differ. How transcription works

Entity details on Wikidata

Categories: