Skip to main content
toIPA
  • Home
  • Text to IPA
  • Speech to IPA
  • IPA to Word
  • IPA ReaderBeta
  • Blog
  • Home
  • two-way deterministic finite automaton

two-way deterministic finite automaton

finite automaton that can re-read its input

en-GB/ˈtuː - ˈweɪ dɪˌtɜːmɪˈnɪstɪk ˈfaɪnaɪt ɔːˈtɒmətən/
en-US/ˈtu - ˈweɪ dɪˌtɝməˈnɪstɪk ˈfaɪˌnaɪt ɑˈtɑməˌtɑn/

Categories:

abstract machine
toIPAText to IPASpeech to IPAIPA to WordIPA ReaderBlogCategories

IPA charts

FullBritish EnglishAmerican EnglishMandarin ChineseIPA chartsA–Z
AboutPrivacy PolicyTerms of Service

© 2026 toIPA. All rights reserved.