List questions from formal-languages

Published on 25 Mar 2026 - 23:36

411

Views

Confirm that this language is context free?

Published on 29 Mar 2026 - 4:09

5.1k

Views

Write a Context Free Grammar for L = {x#y | x =/= reverse of y}

Published on 29 Mar 2026 - 4:11

2k

Views

Context free languages closure property $\{a^n b^n : n\geq 0\} \cup \{a^n b^{2n}: n\geq 0\}$

Published on 29 Mar 2026 - 5:43

9.2k

Views

Existence of NFA of a reverse of a language

Published on 03 Apr 2026 - 23:46

82

Views

Why is the D0L word a least fixed point?

Published on 04 Apr 2026 - 13:06

811

Views

Unbounded number of tapes of Turing Machine

Published on 04 Apr 2026 - 16:37

4.2k

Views

Converting each formula into Conjunctive Normal Form?

Published on 27 Mar 2026 - 9:38

176

Views

Proving what are the equivalence classes of the relation $R_{L}$

Published on 03 Apr 2026 - 23:45

161

Views

How do you encode a programm in a category?

Published on 17 Oct 2012 - 13:21

939

Views

Prove that a formal language is infinite

Published on 20 Oct 2012 - 16:48

16k

Views

How do I show language of prime number of xs not context-free?

Published on 29 Mar 2026 - 5:43

9.4k

Views

Show two finite state machines are equivalent

Published on 02 Apr 2026 - 16:28

1.7k

Views

Generating functions for context-free languages

Published on 29 Mar 2026 - 5:43

4k

Views

Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?

Published on 29 Mar 2026 - 5:42

List Question

Confusion related to the type 3 grammar

Confirm that this language is context free?

Write a Context Free Grammar for L = {x#y | x =/= reverse of y}

Context free languages closure property $\{a^n b^n : n\geq 0\} \cup \{a^n b^{2n}: n\geq 0\}$

Existence of NFA of a reverse of a language

Why is the D0L word a least fixed point?

Unbounded number of tapes of Turing Machine

Converting each formula into Conjunctive Normal Form?

Proving what are the equivalence classes of the relation $R_{L}$

How do you encode a programm in a category?

Prove that a formal language is infinite

How do I show language of prime number of xs not context-free?

Show two finite state machines are equivalent

Generating functions for context-free languages

Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?

Trending Questions

Popular # Hahtags

Popular Questions