List questions from formal-languages

Published on 20 Mar 2026 - 20:13

67

Views

Do these special substring sets form a matroid?

Published on 22 Mar 2026 - 19:32

182

Views

Exitstance of DPA of L = $\{ww^r\}$

Published on 19 Mar 2026 - 20:34

192

Views

Automata defined by group presentations.

Published on 21 Mar 2026 - 6:17

119

Views

Constructing context free grammar with a number constraint to one of the elements in the language

Published on 21 Mar 2026 - 19:18

2.2k

Views

Converting CFG to a regular expression

Published on 20 Mar 2026 - 16:01

187

Views

CSG for the language $\{a^{n^2}|n>0\}$

Published on 20 Mar 2026 - 1:36

254

Views

If true, prove (01+0)0 = 0(10+0), else provide a counter example.

Published on 19 Mar 2026 - 21:54

196

Views

Proof of "Extension" for Rice's Theorem

Published on 22 Mar 2026 - 13:22

141

Views

Prove that this sentence is a tautology.

Published on 22 Mar 2026 - 11:27

80

Views

Write two models of the language

Published on 24 Mar 2026 - 13:11

37

Views

Write two interpretations (models) of this language

Published on 24 Mar 2026 - 21:59

57

Views

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

Published on 20 Mar 2026 - 7:30

457

Views

Intersection of two languages (Formal Languages and Automata Theory)

Published on 23 Mar 2026 - 1:38

41

Views

Looking for an example of a $\mathcal{L}$-expression

Published on 25 Mar 2026 - 4:38

List Question

Simultaneously multiple copies of each of a set of substrings of a string.

Do these special substring sets form a matroid?

Exitstance of DPA of L = $\{ww^r\}$

Automata defined by group presentations.

Constructing context free grammar with a number constraint to one of the elements in the language

Converting CFG to a regular expression

CSG for the language $\{a^{n^2}|n>0\}$

If true, prove (01+0)0 = 0(10+0), else provide a counter example.

Proof of "Extension" for Rice's Theorem

Prove that this sentence is a tautology.

Write two models of the language

Write two interpretations (models) of this language

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

Intersection of two languages (Formal Languages and Automata Theory)

Looking for an example of a $\mathcal{L}$-expression

Trending Questions

Popular # Hahtags

Popular Questions