/sci/ - Science & Math » Thread #12888604

62KiB, 633x758, 1.jpg

View Same Google iqdb SauceNAO

Anonymous Sat 27 Mar 01:50:28 2021 No.12888604 View Reply Original Report

Quoted By: >>12888744 >>12888766 >>12888815

I have 4 days to learn Deterministic Finite Automata, Nondeterministic Finite Automata, Their equivalence, Pumping Lemma, Regular Expressions, Properties of Regular Languages, CFL, CFG, Push down Automata and all their related properties.

I can't do it.

I will fail.

I will get filtered.

Save me /sci/

NEARAutomata

NEARAutomata Sat 27 Mar 2021 02:38:01 No.12888742 Report

Quoted By:

nah my nigga, learn what a markov chain. Its near similar to that. All of CS can basically be deduced to a Automata. Heck all of everything can be.

Anonymous

Anonymous Sat 27 Mar 2021 02:38:57 No.12888744 Report

Quoted By:

>>12888604
dude similar except it's easy as fuck and I'm just bored

Anonymous

Anonymous Sat 27 Mar 2021 02:45:53 No.12888766 Report

Quoted By:

>>12888604
>Pumping Lemma
Nigga I learned the pumping lemma with a bitch in high school wtf are you doing?

Anonymous

Anonymous Sat 27 Mar 2021 02:56:52 No.12888800 Report

Quoted By: >>12888821

Will learning theory of computation get me a job, /sci/? It sounds interesting but it also sounds like it's only used for TCS research.

Anonymous

Anonymous Sat 27 Mar 2021 03:00:27 No.12888815 Report

Quoted By: >>12888962

>>12888604
>Deterministic Finite Automata
you can learn what this is in 10 minutes
>Nondeterministic Finite Automata
you can learn what this is after the above in 1 minute
>Their equivalence,
you can understand the proof in about 30 minutes and by drawing out examples
>, Pumping Lemma,
just practice some stuff from sipser for 2 days and you're golden.
>Regular Expressions
not hard at all if you understand regular langauges
>Properties of Regular Languages
not hard if you understand basic proof mathematics. it's literally just unpacking the definition and writing out the intersection / other set theoretic properties
>CFL
harder but doable, give it 3 days and practice some PDA constructions
>CFGs
not hard but tricky to simplify, spend 3 days on this
>PDAs
see above
>all related properties
even easier than regular languages. since they're more powerful, less can be said to strictly characterize them.

Anonymous

Anonymous Sat 27 Mar 2021 03:01:40 No.12888821 Report

Quoted By:

>>12888800
no single class gets you a job anon
>it's only used in TCS research
TCS research studies much more mature / more complicated structures than basic automata. If they talk about basic automata at all, it's usually in the algebraic context of free monoids and semigroups.

Anonymous

Anonymous Sat 27 Mar 2021 03:42:15 No.12888962 Report

Quoted By: >>12889239

>>12888815
THATS MORE THAN 4 DAYS

Anonymous

Anonymous Sat 27 Mar 2021 03:44:17 No.12888969 Report

Quoted By:

https://web.cs.ucdavis.edu/~rogaway/classes/120/fall12/lectures.html

right now my goal is to watch these videos up to Turing machines
Read sipser
Quickly watch my shitty class lectures
And look at how my TA solves some tricky questions

Please pray for me scibros..

Anonymous

Anonymous Sat 27 Mar 2021 03:44:34 No.12888971 Report

Quoted By:

How are you even entitled to the final if you know jack shit about computer science?

Anonymous

Anonymous Sat 27 Mar 2021 04:51:23 No.12889125 Report

Quoted By:

So just learn regex. You just have to accept its ugliness. It's actually quite easy, and very useful.

Standard regex is DFA, and PCRE2 is NFA.

Anonymous

Anonymous Sat 27 Mar 2021 05:37:14 No.12889239 Report

Quoted By:

>>12888962
not full days dude. Just devote a few hours per day to them and you'll be fine.

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches