How do we formally define a DFA?

[@EasyTheory]

Next video: Office Hours #13: ruclips.net/video/lTIQnD_gNS4/видео.html

[@benmontgomery1111]

reviewing for compilers! Anyone here from Dalio's class? Lol! Great video. You helped me so much in theoretical CS so I knew where to go for review.

[@bigbro_songz]

It really is... Easy Theory. Thanks you and keep up the good work. Excellent video and explanations 👏👏👏

[@lukeperry566]

Thanks this helped a lot

[@stevenxu5424]

Thanks for fixing the audio!

[@EasyTheory]

Steven Xu you're welcome!

[@64standardtrickyness]

At the beginning what do you mean by accept state? there are 4 which ones are accept?

[@lowerbound4803]

How do we handle the input that is not in the transition function? What is that called? For example, say, 3 as the input string.

[@EasyTheory]

Good question. We usually say the machine auto rejects because the "type" of input is wrong. The machine usually just operates under a certain alphabet and only takes inputs adhering to that.

[@lowerbound4803]

@@EasyTheory Clear. Thank you for the clarification.

[@samjudelson]

Thanks

[@dancan4949]

Is it correct to say that the transition function is the cartesian product between the set of states Q and language Σ mapped to Q?

[@EasyTheory]

That's exactly what it is! Except that "mapped" can mean many different things.

[@tinnokkwok8510]

Thanks you save my grade

[@codetrooper9279]

Yo

[@kaveenjayamanna3076]

.

[@paidapps733]

From formal definition to code.