>is literally the best computer science concept in existence

>used for everything from compilers to error corrections and digital circuits and regular expressions (which filter out brainlets, another plus)

>simple to understand and implement due to years of development and refinement of the theory

>confuses code monkeys

can you name anything that even comes CLOSE to the power of state machines

>inb4 directed graphs

i don't need to know any of that to use regular expressions and compilers lol

>are you implying that I should know how to tools I use actually work lol

> lmao what a loser, I just press the button and compiler goes brrr and gives code

There are formal grammars that couldn't be defined via state machines though.

What is a turing machine if not a state machine?

It is an infinite state machine. Somehow mire compex than finite one.

oh no not the le html is not a regular language meme again

le html is not a regular language and it is pas un mème.

Turing machines.

>simple to understand and implement due to years of development and refinement of the theory

explain it in less than 500 characters

An abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.

just google it my guy, even a smoothbrain such as yourself knows how to do that

https://en.wikipedia.org/wiki/Finite-state_machine

Post a finite state machine that accepts strings of the form (n 1s followed by n 0s). Surely they are powerful enough?

Typo, it has to only accept those strings for all natural numbers n

Still waiting OP

i just do '1{n}0{n}' and grep does it for me

Post any extant machine capable of doing that.

>is literally the best computer science concept in existence

that's category theory thoughbeitstd've

State is harmful, avoid.

Workflows are superior as machines can track more than one state at time, and dont require an exponential increase of states to account for all their possible combinations

Hey first year CS grad

Glad you are liking your stay

t. SECOND year CS grad

>all the power of a turing machine

>no accepting state

>no starting state

>regardless of the start or end state, uses it to accept a language that a DFA would be fine for.

please, do better

>inb4 directed graphs

nigga an automata IS a directed graph. DYED? (do you even dijkstra?)

Oh yeah?

Can your state machine check deez brackets?

[()]{}{[()()]()}