New posts in Automata

Finite Automaton that accepts only the words baa,ab, abb and no other strings longer or shorter

Difference between NFA and DFA

If $L$ is regular, prove that $\sqrt{L}=\left\{ w : ww\in L\right\}$ is regular

Intersection of two deterministic finite automata?

Why does this FSM accept binary numbers divisible by three?

Eilenberg's rational hierarchy of nonrational automata & languages

How to show that $ALL_{DFA}$ is in P

Design DFA accepting binary strings divisible by a number 'n'

Is it possible for a computer to "learn" a regular expression by user-provided examples?

Regular vs Context Free Grammars