List questions from automata

Published on 01 Dec 2018 - 11:37

53

Views

How can I prove given language is not regular?

Published on 02 Dec 2018 - 11:27

39

Views

NFA to Regular expression

Published on 02 Dec 2018 - 14:46

45

Views

proving that $a^6 \in L$ (tricky) (pumping lemma)

Published on 02 Dec 2018 - 14:48

687

Views

which of the following languages over $\Sigma \{0,1,\$\}$ are regular?

Published on 02 Dec 2018 - 20:42

76

Views

finding equivalence classes of $R_L$ in automata(Nerode)

Published on 22 Mar 2026 - 7:50

141

Views

building a DFA from equivalence classes of $R_L$(tricky)

Published on 21 Mar 2026 - 21:55

175

Views

Convert this grammar to language

Published on 25 Mar 2026 - 4:35

55

Views

How to guess the end of pushdown automata by emptying the stack?

Published on 15 Dec 2018 - 8:41

55

Views

how to prove that L is not context free

Published on 18 Dec 2018 - 17:22

69

Views

Prove that the grammar defines language

Published on 21 Dec 2018 - 17:41

58

Views

Is $L_4$ a CFL?

Published on 25 Mar 2026 - 1:15

795

Views

Given a transition table do digraph, determine if it is DFA or NFA and build grammar

Published on 24 Dec 2018 - 22:53

205

Views

What is the source of formal descriptions for large uncomputable ordinals clockable by Infinite Time Turing Machines?

Published on 28 Dec 2018 - 6:44

4.7k

Views

Need a PDA for L={ a^n b^m c^m d^n n,m>=1 }

Published on 25 Mar 2026 - 6:03

List Question

How many Nerode equivalence classes does the language $x\neq y$ have?

How can I prove given language is not regular?

NFA to Regular expression

proving that $a^6 \in L$ (tricky) (pumping lemma)

which of the following languages over $\Sigma \{0,1,\$\}$ are regular?

finding equivalence classes of $R_L$ in automata(Nerode)

building a DFA from equivalence classes of $R_L$(tricky)

Convert this grammar to language

How to guess the end of pushdown automata by emptying the stack?

how to prove that L is not context free

Prove that the grammar defines language

Is $L_4$ a CFL?

Given a transition table do digraph, determine if it is DFA or NFA and build grammar

What is the source of formal descriptions for large uncomputable ordinals clockable by Infinite Time Turing Machines?

Need a PDA for L={ a^n b^m c^m d^n n,m>=1 }

Trending Questions

Popular # Hahtags

Popular Questions