Recent questions tagged automata

A machine is represented by states $Q$ , input alphabet $\sum$, transition function $\hat{\mathrm{o}}$. Initial state $\mathrm{q}_{0}$ and final state $F$. The machine ac...

A Turing Machine for the language $\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq ...

$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM?My question is what $y$ is ac...

Consider the following languages:$L_1 = \{ a^mb^n \mid m \neq n\}$$L_2 = \{ a^mb^n \mid m = 2n+1\}$$L3 = \{ a^mb^n \mid m \neq 2n\}$Which one of the following statements ...